paper

Dynamics of the symmetric eigenvalue problem with shift strategies

arXiv:1108.6030 · doi:10.1093/imrn/rns186

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 $s \in \RR$ defines a map . A strategy $σ: {\cal T}_Λ\to \RR$ 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 gives rise systematically to bottom deflation, convergence to zero of the lowest off-diagonal entry . For most shift strategies, convergence to zero of is cubic, for . The existence of arithmetic progressions in the spectrum of sometimes implies instead quadratic convergence, . The complete integrability of the Toda lattice and the dynamics at non-smooth points are central to our discussion. The text does not assume knowledge of numerical linear algebra.

22 pages, 4 figures. This preprint borrows heavily from the unpublished preprint arXiv:0912.3376 but is adapted for a different audience

References in corpus (4)

Cited by in corpus (2)