Dynamics of the symmetric eigenvalue problem with shift strategies
Ricardo S. Leite, Nicolau C. Saldanha, Carlos Tomei

TL;DR
This paper analyzes the dynamics of shifted QR algorithms for symmetric eigenvalue problems, focusing on convergence rates and the impact of spectrum structure and strategy discontinuities.
Contribution
It provides a detailed theoretical analysis of the convergence behavior of shift strategies in symmetric eigenvalue computations, including the effects of spectrum structure and discontinuities.
Findings
Most shift strategies lead to cubic convergence to zero of off-diagonal entries.
Discontinuities in shift strategies are necessary for fast deflation.
Spectrum arithmetic progressions can cause quadratic convergence.
Abstract
A common algorithm for the computation of eigenvalues of real symmetric tridiagonal matrices is the iteration of certain special maps called shifted steps. Such maps preserve spectrum and a natural common domain is , the manifold of real symmetric tridiagonal matrices conjugate to the diagonal matrix . More precisely, a (generic) shift defines a map . A strategy specifies the shift to be applied at so that . Good shift strategies should lead to fast deflation: some off-diagonal coordinate tends to zero, allowing for reducing of the problem to submatrices. For topological reasons, continuous shift strategies do not obtain fast deflation; many standard strategies are indeed discontinuous. Practical implementation only…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
