GLOBAL CONVERGENCE OF HESSENBERG SHIFTED QR III: APPROXIMATE RITZ VALUES VIA SHIFTED INVERSE ITERATION

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 languageEnglish (US)
Pages (from-to)1212-1246
Number of pages35
JournalSIAM Journal on Matrix Analysis and Applications
Volume46
Issue number2
DOIs
StatePublished - 2025
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Analysis

Keywords

  • Ritz values
  • inverse iteration
  • nonnormality
  • numerical linear algebra
  • shifted QR

Fingerprint

Dive into the research topics of 'GLOBAL CONVERGENCE OF HESSENBERG SHIFTED QR III: APPROXIMATE RITZ VALUES VIA SHIFTED INVERSE ITERATION'. Together they form a unique fingerprint.

Cite this