SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
We first introduce a second-order Krylov subspace $\mathcal{G}_n$(A,B;u) based on a pair of square matrices A and B and a vector u. The subspace is spanned by a sequence of vectors defined via a second-order linear homogeneous recurrence relation with coefficient matrices A and B and an initial vector u. It generalizes the well-known Krylov subspace $\mathcal{K}_n$(A;v), which is spanned by a sequence of vectors defined via a first-order linear homogeneous recurrence relation with a single coefficient matrix A and an initial vector v. Then we present a second-order Arnoldi (SOAR) procedure for generating an orthonormal basis of $\mathcal{G}_n$(A,B;u). By applying the standard Rayleigh--Ritzorthogonal projection technique, we derive an SOAR method for solving a large-scale quadratic eigenvalue problem (QEP). This method is applied to the QEP directly. Hence it preserves essential structures and properties of the QEP. Numerical examples demonstrate that the SOAR method outperforms convergence behaviors of the Krylov subspace--based Arnoldi method applied to the linearized QEP.
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. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Numerical Methods for Large Eigenvalue Problems: Revised Edition
Saad, Y. (2011) · doi:10.1137/1.9781611970739 · Cited by 2,364
Applied Numerical Linear Algebra
Demmel, J. W. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971446 · Cited by 2,299
Applied numerical linear algebra
(1998) · Choice Reviews Online · doi:10.5860/choice.35-3919 · Cited by 2,170
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
The Quadratic Eigenvalue Problem
Tisseur, F., & Meerbergen, K. (2001) · SIAM Review · doi:10.1137/s0036144500381988 · Cited by 1,402
The Symmetric Eigenvalue Problem.
Wilkinson, J. H., & Parlett, B. N. (1981) · Mathematics of Computation · doi:10.2307/2007453 · Cited by 1,186
Matrix Algorithms: Volume II: Eigensystems
Stewart, G. W. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718058 · Cited by 693
Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide
(2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719581 · Cited by 670
Lambda-Matrices and Vibrating Systems
Lancaster, P., Sneddon, I. N., Stark, M., & Kahane, J. P. (1966) · Elsevier eBooks · doi:10.1016/c2013-0-01959-7 · Cited by 666
Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems
Bai, Z. (2002) · Applied Numerical Mathematics · doi:10.1016/s0168-9274(02)00116-2 · Cited by 633
Self-citationStewart, G. W. (1998) · Cited by 383
Backward error and condition of polynomial eigenvalue problems
Françoise Tisseur, B. (2000) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(99)00063-4 · Cited by 295
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
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
Slone, R. D., Lee, R., & Lee, J. (2003) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.855 · Cited by 36
Krylov type subspace methods for matrix polynomials
Hoffnung, L., Ren-cang Li, C., & Ye, Q. (2005) · Linear Algebra and its Applications · doi:10.1016/j.laa.2005.09.016 · Cited by 28
Metadata
- Authors
- Bai, Z., & Su, Y.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2005-01
- Volume
- 26
- Issue
- 3
- Pages
- 640-659
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2051096875
- Cited by
- 262
- References
- 18
- FWCI
- 12.24
- 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.