A note on the convergence behavior of GMRES

DOI10.1016/S0168-9274(97)00039-1zbMath0884.65025OpenAlexW2006753818MaRDI QIDQ1369205

Zhi-Hao Cao

Publication date: 2 April 1998

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-9274(97)00039-1

zbMATH Keywords

convergenceGMRESgeneralized minimal residual methodsymmetric linear systems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (3)

Hybrid methods based on LCG and GMRES ⋮ Fast iterative solution of stabilized Navier--Stokes systems ⋮ Preconditioning Methods for Thin Scattering Structures Based on Asymptotic Results

Cites Work

• The rate of convergence of conjugate gradients
• Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
• The superlinear convergence behaviour of GMRES
• Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
• On hybrid iterative methods for nonsymmetric systems of linear equations
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
• Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms

This page was built for publication: A note on the convergence behavior of GMRES