GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Yousef Saad, Martin H. Schultz
SIAM Journal on Scientific and Statistical Computing · 1986 · 11,386 citations
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Saad, Y., & Schultz, M. H. (1986). GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 7(3), 856–869. https://doi.org/10.1137/0907058
In text: (Saad & Schultz, 1986)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
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
- LINCS: A linear constraint solver for molecular simulations1997
- Methods of conjugate gradients for solving linear systems1952
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs1998
- A Singular Value Thresholding Algorithm for Matrix Completion2010
- Introduction to Numerical Analysis.1981
Metadata from OpenAlex (CC0). Citations are generated from the published record.