File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.amc.2004.04.025
- Scopus: eid_2-s2.0-17444417455
- WOS: WOS:000229221400010
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Iterative methods for Robbins problems
| Title | Iterative methods for Robbins problems |
|---|---|
| Authors | |
| Issue Date | 2005 |
| Citation | Applied Mathematics and Computation, 2005, v. 165, n. 1, p. 103-125 How to Cite? |
| Abstract | Preconditioned iterative methods are described for the solution of an elliptic partial differential equation over an unit square region with Robbins boundary conditions. Transform based preconditioners are constructed and analyzed. The motivation is to exploit the fast inversion of transform based systems via the fast transform. We prove that transform based preconditioners can be chosen so that the condition number of the preconditioned system can be reduced from O(n2) to O(1). Numerical results are reported to illustrate the effectiveness of the preconditioners. © 2004 Elsevier Inc. All rights reserved. |
| Persistent Identifier | http://hdl.handle.net/10722/276744 |
| ISSN | 2023 Impact Factor: 3.5 2023 SCImago Journal Rankings: 1.026 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ho, Andy C. | - |
| dc.contributor.author | Ng, Michael K. | - |
| dc.date.accessioned | 2019-09-18T08:34:31Z | - |
| dc.date.available | 2019-09-18T08:34:31Z | - |
| dc.date.issued | 2005 | - |
| dc.identifier.citation | Applied Mathematics and Computation, 2005, v. 165, n. 1, p. 103-125 | - |
| dc.identifier.issn | 0096-3003 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/276744 | - |
| dc.description.abstract | Preconditioned iterative methods are described for the solution of an elliptic partial differential equation over an unit square region with Robbins boundary conditions. Transform based preconditioners are constructed and analyzed. The motivation is to exploit the fast inversion of transform based systems via the fast transform. We prove that transform based preconditioners can be chosen so that the condition number of the preconditioned system can be reduced from O(n2) to O(1). Numerical results are reported to illustrate the effectiveness of the preconditioners. © 2004 Elsevier Inc. All rights reserved. | - |
| dc.language | eng | - |
| dc.relation.ispartof | Applied Mathematics and Computation | - |
| dc.title | Iterative methods for Robbins problems | - |
| dc.type | Article | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1016/j.amc.2004.04.025 | - |
| dc.identifier.scopus | eid_2-s2.0-17444417455 | - |
| dc.identifier.volume | 165 | - |
| dc.identifier.issue | 1 | - |
| dc.identifier.spage | 103 | - |
| dc.identifier.epage | 125 | - |
| dc.identifier.isi | WOS:000229221400010 | - |
| dc.identifier.issnl | 0096-3003 | - |