GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
SIAM Journal on Scientific and Statistical Computing1986Vol. 7(3), pp. 856–869
Citations Over TimeTop 1% of 1986 papers
Abstract
We present an iterative method for solving linear systems, which has the property of minimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an $l_2 $-orthogonal basis of Krylov subspaces. It can be considered as a generalization of Paige and Saunders’ MINRES algorithm and is theoretically equivalent to the Generalized Conjugate Residual (GCR) method and to ORTHODIR. The new algorithm presents several advantages over GCR and ORTHODIR.
Related Papers
- → Restrictively preconditioned conjugate gradient methods for systems of linear equations(2003)108 cited
- → On IGMRES: An incomplete generalized minimal residual method for large unsymmetric linear systems(1998)3 cited
- → A note on the efficiency of the conjugate gradient method for a class of time‐dependent problems(2007)1 cited
- → Theory of Krylov Subspace Methods(2020)