On a conjugate gradient-type method for solving complex symmetric linear systems
Publication:1301296
DOI10.1016/S0024-3795(98)10091-5zbMath0941.65031WikidataQ127908571 ScholiaQ127908571MaRDI QIDQ1301296
Ronald Stöver, Angelika Bunse-Gerstner
Publication date: 20 July 2000
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
algorithmnumerical examplesLanczos methodsparse matricesnormal equationsKrylov subspace methodscomplex coefficient matricesconjugate gradient-type iterative methodlarge sparse systems of linear equations
Iterative numerical methods for linear systems (65F10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)
Related Items (35)
Uses Software
Cites Work
- Singular value decompositions of complex symmetric matrices
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Matrix Analysis
- Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
- How Fast are Nonsymmetric Matrix Iterations?
- A fast minimal residual algorithm for shifted unitary matrices
This page was built for publication: On a conjugate gradient-type method for solving complex symmetric linear systems