The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Krylov subspace methods for solving large unsymmetric linear systems
Abstract
Some algorithms based upon a projection process onto the Krylov subspace K m = Span ( r 0 , A r 0 , … , A m − 1 r 0 ) are developed, generalizing the method of Conjugate gradients to unsymmetric systems. These methods are extensions of Arnoldi’s algorithm for solving eigenvalue problems. The convergence is analyzed in terms of the distance of the solution to the subspace K m and some error bounds are established showing, in particular, a similarity with the conjugate gradient method (for symmetric matrices) when the eigenvalues are real. Several numerical experiments are described and discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Rivlin, T. J. (1974) · International Linear Collider · Cited by 1,988
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
Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations
Stone, H. L. (1968) · SIAM Journal on Numerical Analysis · doi:10.1137/0705044 · Cited by 1,692
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
Computational Methods of Linear Algebra
H., A. S., Faddeev, D. K., & Faddeeva, V. N. (1964) · Mathematics of Computation · doi:10.2307/2003785 · Cited by 1,599
The Theory of Matrices in Numerical Analysis.
Haynsworth, E. V., & Householder, A. S. (1966) · The American Mathematical Monthly · doi:10.2307/2314680 · Cited by 1,363
(2017) · Approximation Techniques for Engineers · doi:10.1201/9781315205007-4 · Cited by 1,155
THE THEORY OF MATRICES IN NUMERICAL ANALYSIS
Mirsky, L. (1965) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-40.1.378b · Cited by 1,148
Solution of systems of linear equations by minimized iterations
Lanczos, C. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.006 · Cited by 929
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-citationGMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,154
Self-citationNumerical solution of saddle point problems
Benzi, M., Golub, G. H., & Liesen, J. (2005) · Acta Numerica · doi:10.1017/s0962492904000212 · Cited by 2,300
On Krylov Subspace Approximations to the Matrix Exponential Operator
Hochbruck, M., & Lubich, C. (1997) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142995280572 · Cited by 795
Anderson Acceleration for Fixed-Point Iterations
Walker, H. F., & Ni, P. (2011) · SIAM Journal on Numerical Analysis · doi:10.1137/10078356x · Cited by 590
Metadata
- Authors
- Saad, Y.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1981
- Volume
- 37
- Issue
- 155
- Pages
- 105-126
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W1998366068
- Cited by
- 449
- References
- 14
- FWCI
- 6.82
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Krylov subspace methods for solving large unsymmetric linear systems. https://app.cochat.ai/papers/10.1090/s0025-5718-1981-0616364-6
- The paper
- Saad, Y. (1981). Krylov subspace methods for solving large unsymmetric linear systems. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1981-0616364-6
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.