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.
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
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
A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
G. Sleijpen, G. L., & Van der Vorst, H. A. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479894270427 · Cited by 848
Self-citationPassing the one-billion limit in full configuration-interaction (FCI) calculations
Olsen, J., Jørgensen, P., & Simons, J. (1990) · Chemical Physics Letters · doi:10.1016/0009-2614(90)85633-n · Cited by 381
Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
Fokkema, D. R., Sleijpen, G. L. G., & Van der Vorst, H. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596300073 · Cited by 323
Self-citationJacobi-davidson type methods for generalized eigenproblems and polynomial eigenproblems
Sleijpen, G. L. G., Booten, A. G. L., Fokkema, D. R., & van der Vorst, H. A. (1996) · BIT Numerical Mathematics · doi:10.1007/bf01731936 · Cited by 267
Self-citationApproximate 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-citationComputing interior eigenvalues of large matrices
Morgan, R. B. (1991) · Linear Algebra and its Applications · doi:10.1016/0024-3795(91)90381-6 · Cited by 221
Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
Morgan, R. B., & Scott, D. S. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907054 · Cited by 186
Crouzeix, M., Philippe, B., & Sadkane, M. (1994) · SIAM Journal on Scientific Computing · doi:10.1137/0915004 · Cited by 182
Jacobi, C. G. J. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139568012.016 · Cited by 163
Rational Krylov algorithms for nonsymmetric eigenvalue problems. II. matrix pairs
Ruhe, A. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90492-8 · Cited by 158
Ostrowski, A. M. (1957) · Archive for Rational Mechanics and Analysis · doi:10.1007/bf00298007 · Cited by 132
A space‐saving modification of Davidson's eigenvector algorithm
LENTHE, J. H. V., & Pulay, P. (1990) · Journal of Computational Chemistry · doi:10.1002/jcc.540111008 · Cited by 114
Françoise Tisseur, B., & Dongarra, J. J. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598336951 · Cited by 107
Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
Freund, R. W. (1992) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(92)90263-w · Cited by 81
Sleijpen, G. L. G., van der Vorst, H. A., & Meijerink, E. (1998) · Cited by 67
Self-citationAccelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations
Fokkema, D. R., Sleijpen, G. L. G., & van der Vorst, H. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595296148 · Cited by 61
Self-citationThe convergence behavior of ritz values in the presence of close eigenvalues
van der Sluis, A., & van der Vorst, H. A. (1987) · Linear Algebra and its Applications · doi:10.1016/0024-3795(87)90129-7 · Cited by 60
Quadratic eigenproblems are no problem
Sleijpen, G. L. G., van der Vorst, H. A., & van Gijzen, M. B. (1996) · Utrecht University Repository (Utrecht University) · Cited by 54
Self-citationShen, J. H., & Wendoloski, J. J. (1996) · Journal of Computational Chemistry · doi:10.1002/(sici)1096-987x(199602)17:3<267::aid-jcc1>3.0.co;2-t · Cited by 37
Sleijpen, G. L. G., & van der Vorst, H. A. (1995) · Utrecht University Repository (Utrecht University) · Cited by 30
Self-citation
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
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.