The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
Abstract
In this paper we propose a new method for the iterative computation of a few of the extremal eigenvalues of a symmetric matrix and their associated eigenvectors. The method is based on an old and almost unknown method of Jacobi. Jacobi's approach, combined with Davidson's method, leads to a new method that has improved convergence properties and that may be used for general matrices. We also propose a variant of the new method that may be useful for the computation of nonextremal eigenvalues as well.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
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
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Lehoucq, R. B., Sorensen, D. C., & Yang, C. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719628 · Cited by 2,936
Davidson, E. R. (1975) · Journal of Computational Physics · doi:10.1016/0021-9991(75)90065-0 · Cited by 2,517
Numerical Methods for Large Eigenvalue Problems: Revised Edition
Saad, Y. (2011) · doi:10.1137/1.9781611970739 · Cited by 2,364
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
Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide
Demmel, J. W., Dongarra, J. J., Ruhe, A., van der Vorst, H. A., & Bai, Z. (1987) · Medical Entomology and Zoology · Cited by 1,102
Cited by
octopus:a tool for the application of time‐dependent density functional theory
Castro, A., Appel, H., Oliveira, M., Rozzi, C. A., Andrade, X., Lorenzen, F., Marques, M. A. L., Gross, E. K. U., & Rubio, A. (2006) · physica status solidi (b) · doi:10.1002/pssb.200642067 · Cited by 894
Theofilis, V. (2011) · Annual Review of Fluid Mechanics · doi:10.1146/annurev-fluid-122109-160705 · Cited by 732
On Many-Body Localization for Quantum Spin Chains
Imbrie, J. Z. (2016) · Journal of Statistical Physics · doi:10.1007/s10955-016-1508-x · Cited by 626
Metadata
- Authors
- Sleijpen, G. L. G., & Van der Vorst, H. A.
- Venue
- SIAM Review
- Published
- 2000-01
- Volume
- 42
- Issue
- 2
- Pages
- 267-293
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W1977937121
- Cited by
- 304
- References
- 30
- FWCI
- 1.35
- 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: A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems. https://app.cochat.ai/papers/10.1137/s0036144599363084
- The paper
- Sleijpen, G. L. G., & Van der Vorst, H. A. (2000). A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems. SIAM Review. https://doi.org/10.1137/s0036144599363084
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.