The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
Abstract
Recently the Jacobi--Davidson subspace iteration method has been introduced as a new powerful technique for solving a variety of eigenproblems. In this paper we will further exploit this method and enhance it with several techniques so that practical and accurate algorithms are obtained. We will present two algorithms, JDQZ for the generalized eigenproblem and JDQR for the standard eigenproblem, that are based on the iterative construction of a (generalized) partial Schur form. The algorithms are suitable for the efficient computation of several (even multiple) eigenvalues and the corresponding eigenvectors near a user-specified target value in the complex plane. An attractive property of our algorithms is that explicit inversion of operators is avoided, which makes them potentially attractive for very large sparse matrix problems. We will show how effective restarts can be incorporated in the Jacobi--Davidson methods, very similar to the implicit restart procedure for the Arnoldi process. Then we will discuss the use of preconditioning, and, finally, we will illustrate the behavior of our algorithms by a number of well-chosen numerical experiments.
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
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
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90038-5 · Cited by 2,437
Numerical Methods for Large Eigenvalue Problems: Revised Edition
Saad, Y. (2011) · doi:10.1137/1.9781611970739 · Cited by 2,364
Dembo, R. S., Eisenstat, S. C., & Steihaug, T. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719025 · Cited by 1,539
Meijerink, J. A., & van der Vorst, H. A. (1977) · Mathematics of Computation · doi:10.1090/s0025-5718-1977-0438681-4 · Cited by 1,416
Self-citationBogaevski, V. N., & Povzner, A. (1991) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-4438-7_1 · Cited by 1,384
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
An Algorithm for Generalized Matrix Eigenvalue Problems
Moler, C., & Stewart, G. W. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710024 · Cited by 1,224
Cited by
(2008) · Journal of Machine Learning Research · Cited by 33,051
The Quadratic Eigenvalue Problem
Tisseur, F., & Meerbergen, K. (2001) · SIAM Review · doi:10.1137/s0036144500381988 · Cited by 1,402
Knyazev, A. V. (2001) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827500366124 · Cited by 778
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
Metadata
- Authors
- Fokkema, D. R., Sleijpen, G. L. G., & Van der Vorst, H. A.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 1998-01
- Volume
- 20
- Issue
- 1
- Pages
- 94-125
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W1988464212
- Cited by
- 323
- References
- 24
- FWCI
- 19.08
- 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: Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils. https://app.cochat.ai/papers/10.1137/s1064827596300073
- The paper
- Fokkema, D. R., Sleijpen, G. L. G., & Van der Vorst, H. A. (1998). Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils. SIAM Journal on Scientific Computing. https://doi.org/10.1137/s1064827596300073
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.