On a conjugate gradient-type method for solving complex symmetric linear systems
From MaRDI portal
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
A new iteration method for a class of complex symmetric linear systems, Fast parameterized inexact Uzawa method for complex symmetric linear systems, On the generalized AOR and CG iteration methods for a class of block two-by-two linear systems, Accelerated PMHSS iteration methods for complex symmetric linear systems, Unnamed Item, Nonlinear eigenvalue and frequency response problems in industrial practice, A splitting method for complex symmetric indefinite linear system, A COCR method for solving complex symmetric linear systems, Preconditioning complex symmetric linear systems, The inexact Euler-extrapolated block preconditioners for a class of complex linear systems, A preconditioned SSOR iteration method for solving complex symmetric system of linear equations, Solution of generalized shifted linear systems with complex symmetric matrices, A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport, Several variants of the Hermitian and skew-Hermitian splitting method for a class of complex symmetric linear systems, Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems, A splitting iterative method for the discrete dynamic linear systems, Practical RPCG methods for complex symmetric linear systems, Converting BiCR method for linear equations with complex symmetric matrices, Two-parameter double-step scale splitting real-valued iterative method for solving complex symmetric linear systems, Reordering-based Schur complement preconditioners for a class of two-by-two block complex linear systems, Preconditioning of complex symmetric linear systems with applications in optical tomography, Generalized preconditioned MHSS method for a class of complex symmetric linear systems, Improved bounds for the recursion width in congruent type methods for solving systems of linear equations, A variant of the HSS preconditioner for complex symmetric indefinite linear systems, A new iterative method for solving complex symmetric linear systems, A preconditioner based on a splitting-type iteration method for solving complex symmetric indefinite linear systems, Reducing complex matrices to condensed forms by unitary congruence transformations, Double parameter splitting (DPS) iteration method for solving complex symmetric linear systems, On symmetric block triangular splitting iteration method for a class of complex symmetric system of linear equations, Low-rank perturbations of normal and conjugate-normal matrices and their condensed forms under unitary similarities and congruences, Real valued iterative methods for solving complex symmetric linear systems, Algebraic multigrid for complex symmetric matrices and applications, A new two-parameter iteration method for indefinite complex symmetric linear systems, A block alternating splitting iteration method for a class of block two-by-two complex linear systems, On SSOR iteration method for a class of block two-by-two linear systems
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
