The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Iterative Methods for Sparse Linear Systems
Abstract
Preface 1. Background in linear algebra 2. Discretization of partial differential equations 3. Sparse matrices 4. Basic iterative methods 5. Projection methods 6. Krylov subspace methods Part I 7. Krylov subspace methods Part II 8. Methods related to the normal equations 9. Preconditioned iterations 10. Preconditioning techniques 11. Parallel implementations 12. Parallel preconditioners 13. Multigrid methods 14. Domain decomposition methods Bibliography Index.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
GMRES: 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-citationGantmacher, F. R. (1984) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 8,520
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
Varga, R. S. (2000) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-05156-2 · Cited by 5,811
van der Vorst, H. A. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913035 · Cited by 5,308
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
Numerical Computation of Internal and External Flows
(2007) · Elsevier eBooks · doi:10.1016/b978-0-7506-6594-0.x5037-1 · Cited by 3,474
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Introduction to matrix computations
Stewart, G. W. (1973) · International Linear Collider · Cited by 2,381
Numerical Methods for Large Eigenvalue Problems: Revised Edition
Saad, Y. (2011) · doi:10.1137/1.9781611970739 · Cited by 2,364
Self-citationAn Introduction to the Conjugate Gradient Method Without the Agonizing Pain
Shewchuk, J. R. (1994) · Cited by 2,173
Axelsson, O. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624100 · Cited by 2,085
Introduction to Approximation Theory
Rivlin, T., & Cheney, E. W. (1969) · Mathematics of Computation · doi:10.2307/2004443 · Cited by 2,035
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
Introduction to the Numerical Solution of Markov Chains
Stewart, W. J. (1995) · Princeton University Press eBooks · doi:10.1515/9780691223384 · Cited by 1,750
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
Direct Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
A Flexible Inner-Outer Preconditioned GMRES Algorithm
Saad, Y. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914028 · Cited by 1,445
Self-citationMeijerink, J. A., & van der Vorst, H. A. (1977) · Mathematics of Computation · doi:10.1090/s0025-5718-1977-0438681-4 · Cited by 1,416
Parallel and distributed computation
Bertsekas, D. P., Tsitsiklis, J. N., & Sennikov, A. N. (1989) · Cited by 1,187
CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
Sonneveld, P. (1989) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0910004 · Cited by 1,169
Iterative Methods by Space Decomposition and Subspace Correction
Xu, J. (1992) · SIAM Review · doi:10.1137/1034116 · Cited by 1,163
QMR: a quasi-minimal residual method for non-Hermitian linear systems
Freund, R. W., & Nachtigal, N. M. (1991) · Numerische Mathematik · doi:10.1007/bf01385726 · Cited by 979
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
SPARSKIT: A basic tool kit for sparse matrix computations
Saad, Y. (1990) · NASA Technical Reports Server (NASA) · Cited by 734
Self-citationDuff, I. S., Grimes, R. G., & Lewis, J. G. (1989) · ACM Transactions on Mathematical Software · doi:10.1145/62038.62043 · Cited by 650
A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
Freund, R. W. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914029 · Cited by 623
Domain decomposition algorithms
Chan, T. F.-C., & Mathew, T. P. (1994) · Acta Numerica · doi:10.1017/s0962492900002427 · Cited by 622
Padé-Type Approximation and General Orthogonal Polynomials
Brezinski, C. (1980) · International series of numerical mathematics · doi:10.1007/978-3-0348-6558-6 · Cited by 555
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Hendrickson, B., & Leland, R. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916028 · Cited by 480
Extrapolation Methods: Theory and Practice.
Wimp, J., Brezinski, C., & Zaglia, M. R. (1993) · Mathematics of Computation · doi:10.2307/2153136 · Cited by 462
Krylov 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-citationSolving Linear Systems on Vector and Shared Memory Computers.
Ortega, J. M., Dongarra, J. J., Duff, I. S., Sorensen, D. C., & van der Vorst, H. A. (1992) · Mathematics of Computation · doi:10.2307/2153226 · Cited by 437
Computational Variants of the Lanczos Method for the Eigenproblem
PAIGE, C. C. (1972) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/10.3.373 · Cited by 408
Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
Freund, R. W. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913023 · Cited by 371
Hughes, T. J. R., Ferencz, R. M., & Hallquist, J. O. (1987) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/0045-7825(87)90005-3 · Cited by 182
A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
Gutknecht, M. H. (1994) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479890188803 · Cited by 157
An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
Simoncini, V., & Gallopoulos, E. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916053 · Cited by 154
Ruhe, A. (1979) · Mathematics of Computation · doi:10.1090/s0025-5718-1979-0521282-9 · Cited by 149
Bundy, A., & Wallen, L. A. (1984) · Springer eBooks · doi:10.1007/978-3-642-96868-6_25 · Cited by 138
Miller, G. L., Teng, S., Thurston, W. P. H., & Vavasis, S. A. (1993) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4613-8369-7_3 · Cited by 138
A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
Chan, T. F.-C., Gallopoulos, E., Simoncini, V., Szeto, T., & Tong, C. H. (1994) · SIAM Journal on Scientific Computing · doi:10.1137/0915023 · Cited by 110
Approximation theory and numerical linear algebra
Trefethen, L. N. (1990) · Springer eBooks · doi:10.1007/978-1-4899-3442-0_30 · Cited by 109
CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
Wang, X., Gallivan, K. A., & Bramley, R. (1997) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827594268270 · Cited by 51
A stable Richardson iteration method for complex linear systems
Fischer, B., & Reichel, L. (1989) · Numerische Mathematik · doi:10.1007/bf01396976 · Cited by 46
Mapping Algorithms and Software Environment for Data Parallel PDE Iterative Solvers
Chrisochoides, N. P., Houstis, E. N., & Rice, J. (1994) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1994.1043 · Cited by 35
DOMAIN DECOMPOSER: A Software Tool for Mapping PDE Computations to Parallel Architectures
Chrisochoides, N. P., Houstis, C. E., Houstis, E. N., Papachiou, P. N., & Kortesis, S. K. (1990) · Purdue e-Pubs (Purdue University System) · Cited by 16
Cited by
He, K., Sun, J., & Tang, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.213 · Cited by 5,546
Rue, H., Martino, S., & Chopin, N. (2009) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2008.00700.x · Cited by 5,279
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
An overview of full-waveform inversion in exploration geophysics
Virieux, J., & Operto, S. (2009) · Geophysics · doi:10.1190/1.3238367 · Cited by 3,750
IEEE Transactions on Pattern Analysis and Machine Intelligence
(2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1307293 · Cited by 3,721
Metadata
- Authors
- Saad, Y.
- Venue
- Society for Industrial and Applied Mathematics eBooks
- Published
- 2003-01
- OpenAlex
- W1506342804
- Cited by
- 13,790
- References
- 50
- FWCI
- 91.32
- Type
- book
- 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.