The DOI matches its Crossref record.
Solution of systems of linear equations by minimized iterations
Open accessAbstract
A simple algorithm is described whi ch is well adapted to the effective solu tio n of large syste ms of linear a lgebraic eq uations by a succession of well-converge n t approximations.
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
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
Iterative methods for linear and nonlinear equations
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4556 · Cited by 1,947
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
Preconditioning Techniques for Large Linear Systems: A Survey
Benzi, M. (2002) · Journal of Computational Physics · doi:10.1006/jcph.2002.7176 · Cited by 1,221
Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization
Peherstorfer, B., Willcox, K., & Gunzburger, M. (2018) · SIAM Review · doi:10.1137/16m1082469 · Cited by 1,061
Optimal combination forecasts for hierarchical time series
Hyndman, R. J., Ahmed, R. A., Athanasopoulos, G., & Shang, H. L. (2011) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2011.03.006 · Cited by 467
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
Iterative solution of linear systems
Freund, R. W., Golub, G. H., & Nachtigal, N. M. (1992) · Acta Numerica · doi:10.1017/s0962492900002245 · Cited by 434
A priori hyperreduction method: an adaptive approach
Ryckelynck, D. (2005) · Journal of Computational Physics · doi:10.1016/j.jcp.2004.07.015 · Cited by 396
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
Discrete logarithms in finite fields and their cryptographic significance
Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39757-4_20 · Cited by 367
Schlegel, H. B. (2011) · WIREs Computational Molecular Science · doi:10.1002/wcms.34 · Cited by 360
Taillefumier, M., Cabaret, D., Flank, A.-M., & Mauri, F. (2002) · Physical Review B · doi:10.1103/physrevb.66.195107 · Cited by 328
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
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
Prospects of quantum computing for molecular sciences
Liu, H., Low, G. H., Steiger, D. S., Häner, T., Reiher, M., & Troyer, M. (2022) · Materials Theory · doi:10.1186/s41313-021-00039-z · Cited by 73
Metadata
- Authors
- Lanczos, C.
- Venue
- Journal of Research of the National Bureau of Standards
- Published
- 1952-07
- Volume
- 49
- Issue
- 1
- Pages
- 33
- ISSN
- 0091-0635 (ISSN-L)
- OpenAlex
- W2117366131
- Cited by
- 929
- References
- 0
- FWCI
- 8.32
- Type
- journal article
- Language
- en
- Open access
- bronze
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.