The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The Lanczos algorithm with selective orthogonalization
Open accessAbstract
The simple Lanczos process is very effective for finding a few extreme eigenvalues of a large symmetric matrix along with the associated eigenvectors. Unfortunately, the process computes redundant copies of the outermost eigenvectors and has to be used with some skill. In this paper it is shown how a modification called selective orthogonalization stifles the formation of duplicate eigenvectors without increasing the cost of a Lanczos step significantly. The degree of linear independence among the Lanczos vectors is controlled without the costly process of reorthogonalization.
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
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
The Rotation of Eigenvectors by a Perturbation. III
Davis, C., & Kahan, W. M. (1970) · SIAM Journal on Numerical Analysis · doi:10.1137/0707001 · Cited by 1,175
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
Estimates for Some Computational Techniques in Linear Algebra
Kaniel, S. (1966) · Mathematics of Computation · doi:10.1090/s0025-5718-1966-0234618-4 · Cited by 197
An iterative block lanczos method for the solution of large sparse symmetric eigenproblems.
Underwood, R. (1975) · Cited by 68
Kahan, W., & Parlett, B. Ν. (1976) · Elsevier eBooks · doi:10.1016/b978-0-12-141050-6.50013-1 · Cited by 27
Self-citationHow Far Should You Go With the Lanczos Process.
Kahan, W., & Parlett, B. (1975) · Defense Technical Information Center (DTIC) · Cited by 11
Self-citation
Cited by
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
Large-Scale Sparse Singular Value Computations
Berry, M. W. (1992) · The International Journal of Supercomputing Applications · doi:10.1177/109434209200600103 · Cited by 402
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
Sine, W. D., Shane, S., & Gregorio, D. D. (2003) · Management Science · doi:10.1287/mnsc.49.4.478.14416 · Cited by 330
Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
Kilmer, M. E., & O'Leary., D. P. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899345960 · Cited by 315
Metadata
- Authors
- Parlett, B. N., & Scott, D. S.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1979
- Volume
- 33
- Issue
- 145
- Pages
- 217-238
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W2014168697
- Cited by
- 403
- References
- 7
- FWCI
- 10.63
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Lanczos algorithm with selective orthogonalization. https://app.cochat.ai/papers/10.1090/s0025-5718-1979-0514820-3
- The paper
- Parlett, B. N., & Scott, D. S. (1979). The Lanczos algorithm with selective orthogonalization. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1979-0514820-3
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.