The convergence of Krylov subspace methods for large unsymmetric linear systems

DOI10.1007/BF02580408zbMath0921.65028MaRDI QIDQ4225456

Zhongxiao Jia

Publication date: 29 September 1999

Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)

zbMATH Keywords

convergence; Krylov subspace methods; unsymmetric linear systems

Mathematics Subject Classification ID

65F10: Iterative numerical methods for linear systems

Related Items

Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem, Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems, Some recursions on Arnoldi's method and IOM for large non-Hermitian linear systems, Theoretical and numerical comparisons of GMRES and WZ-GMRES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chebyshev polynomials are not always optimal
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• The Tchebychev iteration for nonsymmetric linear systems
• On IGMRES: An incomplete generalized minimal residual method for large unsymmetric linear systems
• The superlinear convergence behaviour of GMRES
• Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
• A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials
• Krylov Subspace Methods on Supercomputers
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems