File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1137/S0895479800369773
- Scopus: eid_2-s2.0-0037265672
- WOS: WOS:000180640700018
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Fast iterative methods for sinc systems
Title | Fast iterative methods for sinc systems |
---|---|
Authors | |
Keywords | Sinc method Preconditioners Toeplitz matrices Krylov subspace methods Banded matrices |
Issue Date | 2003 |
Citation | SIAM Journal on Matrix Analysis and Applications, 2003, v. 24, n. 2, p. 581-598 How to Cite? |
Abstract | We consider linear systems of equations arising from the sinc method of boundary value problems which are typically nonsymmetric and dense. For the solutions of these systems we propose Krylov subspace methods with banded preconditioners. We prove that our preconditioners are invertible and discuss the convergence behavior of the conjugate gradient method for normal equations (CGNE). In particular, we show that the solution of an n-by-n discrete sinc system arising from the model problem can be obtained in O(n log2 n) operations by using the preconditioned CGNE method. Numerical results are given to illustrate the effectiveness of our fast iterative solvers. |
Persistent Identifier | http://hdl.handle.net/10722/276731 |
ISSN | 2023 Impact Factor: 1.5 2023 SCImago Journal Rankings: 1.042 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ng, Michael K. | - |
dc.contributor.author | Potts, Daniel | - |
dc.date.accessioned | 2019-09-18T08:34:29Z | - |
dc.date.available | 2019-09-18T08:34:29Z | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | SIAM Journal on Matrix Analysis and Applications, 2003, v. 24, n. 2, p. 581-598 | - |
dc.identifier.issn | 0895-4798 | - |
dc.identifier.uri | http://hdl.handle.net/10722/276731 | - |
dc.description.abstract | We consider linear systems of equations arising from the sinc method of boundary value problems which are typically nonsymmetric and dense. For the solutions of these systems we propose Krylov subspace methods with banded preconditioners. We prove that our preconditioners are invertible and discuss the convergence behavior of the conjugate gradient method for normal equations (CGNE). In particular, we show that the solution of an n-by-n discrete sinc system arising from the model problem can be obtained in O(n log2 n) operations by using the preconditioned CGNE method. Numerical results are given to illustrate the effectiveness of our fast iterative solvers. | - |
dc.language | eng | - |
dc.relation.ispartof | SIAM Journal on Matrix Analysis and Applications | - |
dc.subject | Sinc method | - |
dc.subject | Preconditioners | - |
dc.subject | Toeplitz matrices | - |
dc.subject | Krylov subspace methods | - |
dc.subject | Banded matrices | - |
dc.title | Fast iterative methods for sinc systems | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1137/S0895479800369773 | - |
dc.identifier.scopus | eid_2-s2.0-0037265672 | - |
dc.identifier.volume | 24 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | 581 | - |
dc.identifier.epage | 598 | - |
dc.identifier.isi | WOS:000180640700018 | - |
dc.identifier.issnl | 0895-4798 | - |