The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to matrix computations
Stewart, G. W. (1973) · International Linear Collider · Cited by 2,381
The principle of minimized iterations in the solution of the matrix eigenvalue problem
Arnoldi, W. E. (1951) · Quarterly of Applied Mathematics · doi:10.1090/qam/42792 · Cited by 1,818
Solution of Sparse Indefinite Systems of Linear Equations
Paige, C. C., & Saunders, M. A. (1975) · SIAM Journal on Numerical Analysis · doi:10.1137/0712047 · Cited by 1,620
(2008) · Choice Reviews Online · doi:10.5860/choice.45-6220 · Cited by 1,093
Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
Eisenstat, S. C., Elman, H. C., & Schultz, M. H. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720023 · Cited by 929
Self-citationVariations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Saad, Y. (1980) · Linear Algebra and its Applications · doi:10.1016/0024-3795(80)90169-x · Cited by 520
Self-citationKrylov subspace methods for solving large unsymmetric linear systems
Saad, Y. (1981) · Mathematics of Computation · doi:10.1090/s0025-5718-1981-0616364-6 · Cited by 449
Self-citationIterative Solution of Linear Equations in ODE Codes
Gear, C. W., & Saad, Y. (1983) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0904040 · Cited by 115
Self-citation
Cited by
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
Self-citationPhonons and related crystal properties from density-functional perturbation theory
Baroni, S., de Gironcoli, S., Dal Corso, A., & Giannozzi, P. (2001) · Reviews of Modern Physics · doi:10.1103/revmodphys.73.515 · Cited by 10,043
van der Vorst, H. A. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913035 · Cited by 5,308
Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods
Barrett, R., Berry, M., Chan, T. F., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., & van der Vorst, H. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971538 · Cited by 3,479
SUNDIALS: Suite of nonlinear and differential/algebraic equation solvers
Hindmarsh, A. C., Brown, P. N., Grant, K. E., Lee, S. L., Serban, R., Shumaker, D. E., & Woodward, C. S. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1089014.1089020 · Cited by 2,556
Metadata
- Authors
- Saad, Y., & Schultz, M. H.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1986-07
- Volume
- 7
- Issue
- 3
- Pages
- 856-869
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2140153041
- Cited by
- 11,154
- References
- 8
- FWCI
- 30.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.