DMCA
GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems (1986)
Cached
Download Links
| Venue: | SIAM J. SCI. STAT. COMPUT |
| Citations: | 2077 - 41 self |
BibTeX
@ARTICLE{Saad86gmres:a,
author = {Youcef Saad and Martin H. Schultz},
title = {GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems},
journal = {SIAM J. SCI. STAT. COMPUT},
year = {1986},
volume = {7},
number = {3},
pages = {856--869}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present an iterative method for solving linear systems, which has the property ofminimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an l2-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.
