GMRES algorithms over 35 years

Abstract

This paper is about GMRES algorithms for the solution of nonsingular linear systems. We first consider basic algorithms and study their convergence. We then focus on acceleration strategies and parallel algorithms that are useful for solving challenging systems. We also briefly discuss other problems, such as systems with multiple right-hand sides, shifted systems, and singular systems.

References in corpus (15)

• A framework for deflated and augmented Krylov subspace methods
• Deflated GMRES for Systems with Multiple Shifts and Multiple Right-Hand Sides
• Krylov Subspace Recycling for Sequences of Shifted Linear Systems
• An overview of block Gram-Schmidt methods and their stability properties
• A Flexible Krylov Solver for Shifted Systems with Application to Oscillatory Hydraulic Tomography
• A note on the error analysis of classical Gram-Schmidt
• Block Krylov subspace recycling for shifted systems with unrelated right-hand sides
• Pipelined, Flexible Krylov Subspace Methods
• Toward Efficient Polynomial Preconditioning for GMRES
• On fixed-point, Krylov, and $2\times 2$ block preconditioners for nonsymmetric problems
• On GMRES for singular EP and GP systems
• Admissible and attainable convergence behavior of block Arnoldi and GMRES
• Stability of linear GMRES convergence with respect to compact perturbations
• Two recursive GMRES-type methods for shifted linear systems with general preconditioning
• Understanding performance variability in standard and pipelined parallel Krylov solvers

Cited by in corpus (2)

• Enabling Large-Scale and High-Precision Fluid Simulations on Near-Term Quantum Computers
• Randomized block Gram-Schmidt process for solution of linear systems and eigenvalue problems