How Descriptive are GMRES Convergence Bounds?
arXiv:2209.01231
Abstract
GMRES is a popular Krylov subspace method for solving linear systems of equations involving a general non-Hermitian coefficient matrix. The conventional bounds on GMRES convergence involve polynomial approximation problems in the complex plane. Three popular approaches pose this approximation problem on the spectrum, the field of values, or pseudospectra of the coefficient matrix. We analyze and compare these bounds, illustrating with six examples the success and failure of each. When the matrix departs from normality due only to a low-dimensional invariant subspace, we discuss how these bounds can be adapted to exploit this structure. Since the Arnoldi process that underpins GMRES provides approximations to the pseudospectra, one can estimate the GMRES convergence bounds as an iteration proceeds.
arXiv commentCorrected and extended revision of Oxford University Computing Laboratory technical report 99/08
Cited by in corpus (6)
- Development and Analysis of a Block-Preconditioner for the Phase-Field Crystal Equation
- High-productivity, high-performance workflow for virus-scale electrostatic simulations with Bempp-Exafmm
- Stability of linear GMRES convergence with respect to compact perturbations
- Field of values analysis of preconditioners for the Helmholtz equation in lossy media
- Any decreasing cycle-convergence curve is possible for restarted GMRES
- Convergence analysis of GMRES for the Helmholtz equation via pseudospectrum