The DOI matches its Crossref record.
The Davidson Method
Abstract
This paper deals with the Davidson method that computes a few of the extreme eigenvalues of a symmetric matrix and corresponding eigenvectors. A general convergence result for methods based on projection techniques is given and can be applied to the Lanczos method as well. The efficiency of the preconditioner involved in the method is discussed. Finally, by means of numerical experiments, the Lanczos and Davidson methods are compared and a procedure for a dynamic restarting process is described.
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
Kühne, T. D., Iannuzzi, M., Del Ben, M., Rybkin, V. V., Seewald, P., Stein, F., Laino, T., Khaliullin, R. Z., Schütt, O., Schiffmann, F., et al. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0007045 · Cited by 4,468
Block-iterative frequency-domain methods for Maxwell's equations in a planewave basis
Johnson, S., & Joannopoulos, J. (2001) · Optics Express · doi:10.1364/oe.8.000173 · Cited by 3,217
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,685
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
Circular Dichroism of Helicenes Investigated by Time-Dependent Density Functional Theory
Furche, F., Ahlrichs, R., Wachsmann, C., Weber, E., Sobanski, A., Vögtle, F., & Grimme, S. (2000) · Journal of the American Chemical Society · doi:10.1021/ja991960s · Cited by 503
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
Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
Wu, K., & Simon, H. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898334605 · Cited by 306
A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
Sleijpen, G. L. G., & Van der Vorst, H. A. (2000) · SIAM Review · doi:10.1137/s0036144599363084 · Cited by 304
Theoretical Advances in Polariton Chemistry and Molecular Cavity Quantum Electrodynamics
Mandal, A., Taylor, M. A. D., Weight, B. M., Koessler, E. R., Li, X., & Huo, P. (2023) · Chemical Reviews · doi:10.1021/acs.chemrev.2c00855 · Cited by 270
Jacobi-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
Density Functional Methods for Excited States: Equilibrium Structure and Electronic Spectra
Furche, F., & Rappoport, D. (2005) · Theoretical and Computational Chemistry · doi:10.1016/s1380-7323(05)80020-2 · Cited by 254
Modern multireference methods and their application in transition metal chemistry
Khedkar, A., & Roemelt, M. (2021) · Physical Chemistry Chemical Physics · doi:10.1039/d1cp02640b · Cited by 51
Metadata
- Authors
- Crouzeix, M., Philippe, B., & Sadkane, M.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 1994-01
- Volume
- 15
- Issue
- 1
- Pages
- 62-76
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2116732229
- Cited by
- 182
- References
- 0
- FWCI
- 8.73
- 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.