Abstract
We give a self-contained randomized algorithm based on shifted inverse iteration which provably computes the eigenvalues of an arbitrary matrix (Equation presented) up to backward error delta||M|| in (Equation presented) floating point operations using O(log2(n/delta)) bits of precision. While the O(n4) complexity is prohibitive for large matrices, the algorithm is simple and may be useful for computing the eigenvalues of small matrices using a controlled amount of precision, in particular, for computing Ritz values in shifted QR algorithms as in [BGVS22b].
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1212-1246 |
| Number of pages | 35 |
| Journal | SIAM Journal on Matrix Analysis and Applications |
| Volume | 46 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2025 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Analysis
Keywords
- Ritz values
- inverse iteration
- nonnormality
- numerical linear algebra
- shifted QR