The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Jacobi-davidson type methods for generalized eigenproblems and polynomial eigenproblems
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
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
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
Implicit Application of Polynomial Filters in a k -Step Arnoldi Method
Sorensen, D. C. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613025 · Cited by 1,236
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-citationJacobi, C. G. J. (1846) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1846.30.51 · Cited by 486
Passing 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-citation
Cited by
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
The Quadratic Eigenvalue Problem
Tisseur, F., & Meerbergen, K. (2001) · SIAM Review · doi:10.1137/s0036144500381988 · Cited by 1,402
Szalay, P. G., Müller, T., Gidofalvi, G., Lischka, H., & Shepard, R. (2012) · Chemical Reviews · doi:10.1021/cr200137a · Cited by 725
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
“In a paper that appeared in 1996, Sleijpen et al [120] showed that the Jacobi-Davidson method could be applied in order to reduce a given polynomial problem in an n-dimensional space to a similar problem in a much lower m-dimensional space.”
MethodJacobi--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-citationA 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
Self-citationSOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
Bai, Z., & Su, Y. (2005) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479803438523 · Cited by 262
Metadata
- Authors
- Sleijpen, G. L. G., Booten, A. G. L., Fokkema, D. R., & van der Vorst, H. A.
- Venue
- BIT Numerical Mathematics
- Published
- 1996-09
- Volume
- 36
- Issue
- 3
- Pages
- 595-633
- ISSN
- 0006-3835 (ISSN-L)
- 1572-9125
- OpenAlex
- W2027389940
- Cited by
- 267
- References
- 19
- FWCI
- 11.85
- 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.