Abstract
We revisit the numerical stability of the two-level orthogonal Arnoldi (TOAR) method for computing an orthonormal basis of a second-order Krylov subspace associated with two given matrices. We show that the computed basis is close to a basis for a second-order Krylov subspace associated with nearby matrices, provided that the norms of the given matrices are not too large or too small. Thus, we provide conditions that guarantee the numerical stability of the TOAR method in computing orthonormal bases of second-order Krylov subspaces. We also study scaling the quadratic problem for improving the numerical stability of the TOAR procedure when the norms of the matrices are too large or too small.
| Original language | English |
|---|---|
| Pages (from-to) | 1-15 |
| Number of pages | 15 |
| Journal | Linear Algebra and Its Applications |
| Volume | 553 |
| DOIs | |
| State | Published - Sep 15 2018 |
Funding
This paper presents research results of the Belgian Network IAP VII/19 (DYSCO) (Dynamical Systems, Control, and Optimization), funded by the Interuniversity Attraction Poles Programme , initiated by the Belgian State Science Policy Office. The research is also partially funded by the KU-Leuven Research Council grant OT/14/074 . The scientific responsibility rests with its authors.
| Funder number |
|---|
| OT/14/074 |
| IAP VII/19 |
Keywords
- Arnoldi algorithm
- Krylov subspace
- Numerical stability
- Second-order Arnoldi algorithm
- Second-order Krylov subspace
- Two-level orthogonal Arnoldi algorithm
Fingerprint
Dive into the research topics of 'Mixed forward–backward stability of the two-level orthogonal Arnoldi method for quadratic problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver