File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1093/imanum/19.3.357
- Scopus: eid_2-s2.0-0033245816
- WOS: WOS:000081778200003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Fast iterative methods for symmetric sinc-Galerkin systems
Title | Fast iterative methods for symmetric sinc-Galerkin systems |
---|---|
Authors | |
Issue Date | 1999 |
Citation | IMA Journal of Numerical Analysis, 1999, v. 19, n. 3, p. 357-373 How to Cite? |
Abstract | The symmetric sinc-Galerkin method developed by Lund, when applied to the second-order self-adjoint boundary value problem, gives rise to a symmetric coefficient matrix. The coefficient matrix has a special structure so that it can be advantageously used in solving the discrete system. In this paper, we employ the preconditioned conjugate gradient method with banded matrices as preconditioners. We prove that the condition number of the preconditioned matrix is uniformly bounded by a constant independent of the size of the matrix. In particular, we show that the solution of an n-by-n discrete symmetric sinc-Galerkin system can be obtained in O (n log n) operations. We also extend our method to the self-adjoint elliptic partial differential equation. Numerical results are given to illustrate the effectiveness of our fast iterative solvers. |
Persistent Identifier | http://hdl.handle.net/10722/276536 |
ISSN | 2023 Impact Factor: 2.3 2023 SCImago Journal Rankings: 1.861 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ng, Michael K. | - |
dc.date.accessioned | 2019-09-18T08:33:54Z | - |
dc.date.available | 2019-09-18T08:33:54Z | - |
dc.date.issued | 1999 | - |
dc.identifier.citation | IMA Journal of Numerical Analysis, 1999, v. 19, n. 3, p. 357-373 | - |
dc.identifier.issn | 0272-4979 | - |
dc.identifier.uri | http://hdl.handle.net/10722/276536 | - |
dc.description.abstract | The symmetric sinc-Galerkin method developed by Lund, when applied to the second-order self-adjoint boundary value problem, gives rise to a symmetric coefficient matrix. The coefficient matrix has a special structure so that it can be advantageously used in solving the discrete system. In this paper, we employ the preconditioned conjugate gradient method with banded matrices as preconditioners. We prove that the condition number of the preconditioned matrix is uniformly bounded by a constant independent of the size of the matrix. In particular, we show that the solution of an n-by-n discrete symmetric sinc-Galerkin system can be obtained in O (n log n) operations. We also extend our method to the self-adjoint elliptic partial differential equation. Numerical results are given to illustrate the effectiveness of our fast iterative solvers. | - |
dc.language | eng | - |
dc.relation.ispartof | IMA Journal of Numerical Analysis | - |
dc.title | Fast iterative methods for symmetric sinc-Galerkin systems | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1093/imanum/19.3.357 | - |
dc.identifier.scopus | eid_2-s2.0-0033245816 | - |
dc.identifier.volume | 19 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 357 | - |
dc.identifier.epage | 373 | - |
dc.identifier.isi | WOS:000081778200003 | - |
dc.identifier.issnl | 0272-4979 | - |