The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Solution of Sparse Indefinite Systems of Linear Equations
Abstract
The method of conjugate gradients for solving systems of linear equations with a symmetric positive definite matrix A is given as a logical development of the Lanczos algorithm for tridiagonalizing A. This approach suggests numerical algorithms for solving such systems when A is symmetric but indefinite. These methods have advantages when A is large and sparse.
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
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
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
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
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
Least Squares Computations by Givens Transformations Without Square Roots
GENTLEMAN, W. M. (1973) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/12.3.329 · Cited by 479
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
Self-citationA Note on Modifications to the Givens Plane Rotation
Hammarling, S. J. (1974) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/13.2.215 · Cited by 118
Cited by
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
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Paige, C. C., & Saunders, M. A. (1982) · ACM Transactions on Mathematical Software · doi:10.1145/355984.355989 · Cited by 4,387
Self-citationVandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
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
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2005) · SIAM Review · doi:10.1137/s0036144504446096 · Cited by 2,834
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
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
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499350013 · Cited by 1,587
Self-citationPreconditioning Techniques for Large Linear Systems: A Survey
Benzi, M. (2002) · Journal of Computational Physics · doi:10.1006/jcph.2002.7176 · Cited by 1,221
Tretiak, S., & Mukamel, S. (2002) · Chemical Reviews · doi:10.1021/cr0101252 · Cited by 590
Simplicial closure and higher-order link prediction
Benson, A. R., Abebe, R., Schaub, M. T., Jadbabaie, A., & Kleinberg, J. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1800683115 · Cited by 548
A Note on Preconditioning for Indefinite Linear Systems
Murphy, M. F., Golub, G. H., & Wathen, A. J. (2000) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827599355153 · Cited by 540
A review of operational methods of variational and ensemble‐variational data assimilation
Bannister, R. N. (2017) · Quarterly Journal of the Royal Meteorological Society · doi:10.1002/qj.2982 · Cited by 506
Barnard, S. T., & Simon, H. D. (1994) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330060203 · Cited by 488
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
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
Fong, D. C.-L., & Saunders, M. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/10079687x · Cited by 442
Self-citationIterative solution of linear systems
Freund, R. W., Golub, G. H., & Nachtigal, N. M. (1992) · Acta Numerica · doi:10.1017/s0962492900002245 · Cited by 434
Eigenvalue computation in the 20th century
Golub, G. H., & van der Vorst, H. A. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00413-1 · Cited by 388
Recent computational developments in Krylov subspace methods for linear systems
Simoncini, V., & Szyld, D. B. (2007) · Numerical Linear Algebra with Applications · doi:10.1002/nla.499 · Cited by 375
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
Recent Developments in Algorithms and Software for Trust Region Methods
Moré, J. J. (1983) · Mathematical Programming The State of the Art · doi:10.1007/978-3-642-68874-4_11 · Cited by 359
Newton-Type Minimization via the Lanczos Method
Nash, S. G. (1984) · SIAM Journal on Numerical Analysis · doi:10.1137/0721052 · Cited by 338
A Survey of Parallel Algorithms in Numerical Linear Algebra
Heller, D. (1978) · SIAM Review · doi:10.1137/1020096 · Cited by 337
An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
Freund, R. W., Gutknecht, M. H., & Nachtigal, N. M. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914009 · Cited by 304
The Regional Ocean Modeling System (ROMS) 4-dimensional variational data assimilation systems
Moore, A. M., Arango, H. G., Broquet, G., Powell, B. S., Weaver, A. T., & Zavala-Garay, J. (2011) · Progress in Oceanography · doi:10.1016/j.pocean.2011.05.004 · Cited by 283
Three-Dimensional Electromagnetic Modelling and Inversion from Theory to Application
Avdeev, D. B. (2005) · Surveys in Geophysics · doi:10.1007/s10712-005-1836-x · Cited by 276
A survey of truncated-Newton methods
Nash, S. G. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00426-x · Cited by 266
A review of nonlinear FFT-based computational homogenization methods
Schneider, M. (2021) · Acta Mechanica · doi:10.1007/s00707-021-02962-1 · Cited by 265
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Approximate solutions and eigenvalue bounds from Krylov subspaces
Paige, C. C., Parlett, B. N., & van der Vorst, H. A. (1995) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1680020205 · Cited by 260
Self-citationPETSc/TAO Users Manual (Rev. 3.19)
Argonne National Laboratory (ANL), A., Balay, S., USDOE Office of Science (SC), A. S. C. R. (., Abhyankar, S., Adams, M., Benson, S., Brown, J., Brune, P., Buschelman, K., Constantinescu, E., et al. (2023) · doi:10.2172/1968587 · Cited by 67
Metadata
- Authors
- Paige, C. C., & Saunders, M. A.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1975-09
- Volume
- 12
- Issue
- 4
- Pages
- 617-629
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2018850201
- Cited by
- 1,620
- References
- 7
- FWCI
- 5.28
- 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.