File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast iterative methods for sinc systems

TitleFast iterative methods for sinc systems
Authors
KeywordsSinc method
Preconditioners
Toeplitz matrices
Krylov subspace methods
Banded matrices
Issue Date2003
Citation
SIAM Journal on Matrix Analysis and Applications, 2003, v. 24, n. 2, p. 581-598 How to Cite?
AbstractWe 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 Identifierhttp://hdl.handle.net/10722/276731
ISSN
2023 Impact Factor: 1.5
2023 SCImago Journal Rankings: 1.042
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorNg, Michael K.-
dc.contributor.authorPotts, Daniel-
dc.date.accessioned2019-09-18T08:34:29Z-
dc.date.available2019-09-18T08:34:29Z-
dc.date.issued2003-
dc.identifier.citationSIAM Journal on Matrix Analysis and Applications, 2003, v. 24, n. 2, p. 581-598-
dc.identifier.issn0895-4798-
dc.identifier.urihttp://hdl.handle.net/10722/276731-
dc.description.abstractWe 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.languageeng-
dc.relation.ispartofSIAM Journal on Matrix Analysis and Applications-
dc.subjectSinc method-
dc.subjectPreconditioners-
dc.subjectToeplitz matrices-
dc.subjectKrylov subspace methods-
dc.subjectBanded matrices-
dc.titleFast iterative methods for sinc systems-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1137/S0895479800369773-
dc.identifier.scopuseid_2-s2.0-0037265672-
dc.identifier.volume24-
dc.identifier.issue2-
dc.identifier.spage581-
dc.identifier.epage598-
dc.identifier.isiWOS:000180640700018-
dc.identifier.issnl0895-4798-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats