New inverse data for tridiagonal matrices and the asymptotics of Wilkinson’s shift iteration
نویسندگان
چکیده
We introduce bidiagonal coordinates, a new set of spectral coordinates on open dense charts covering the space of real symmetric tridiagonal matrices. In contrast to the standard Jacobi inverse variables, reduced tridiagonal matrices now lie in the interior of some chart. Bidiagonal coordinates are thus convenient for the study of asymptotics of isospectral dynamics, both for continuous and discrete time. In particular, we study the rate of convergence of Wilkinson’s shift iteration. For AP-free spectra (i.e., simple spectra containing no arithmetic progression with 3 terms), convergence is cubic. In order 3, for AP-spectra, however, there exists a matrix P0 such that if Wilkinson’s iteration converges to P0 then convergence is strictly quadratic. Near p0 ∈ R , the bidiagonal coordinates of P0, the set X of initial conditions with convergence to p0 is a union of disjoint arcs Xs meeting at p0, where s ranges over the Cantor set of sign sequences s : N → {1,−1}. Wilkinson’s step takes Xs to X s ′ , where s′ is the left shift of s. The set X is rather thin and for initial conditions near p0 but not in X , cubic convergence still applies.
منابع مشابه
The asymptotics of Wilkinson’s shift iteration
We study the rate of convergence of Wilkinson’s shift iteration acting on Jacobi matrices with simple spectrum. We show that for AP-free spectra (i.e., simple spectra containing no arithmetic progression with 3 terms), convergence is cubic. In order 3, there exists a tridiagonal symmetric matrix P0 which is the limit of a sequence of a Wilkinson iteration, with the additional property that all ...
متن کاملThe Asymptotics of Wilkinson's Shift: Loss of Cubic Convergence
One of the most widely used methods for eigenvalue computation is the QR iteration with Wilkinson’s shift: here the shift s is the eigenvalue of the bottom 2 × 2 principal minor closest to the corner entry. It has been a long-standing conjecture that the rate of convergence of the algorithm is cubic. In contrast, we show that there exist matrices for which the rate of convergence is strictly qu...
متن کاملOn the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملNew inverse data for tridiagonal matrices
We introduce bidiagonal coordinates, a new set of spectral coordinates on open dense charts covering the space of real symmetric tridiagonal matrices of simple spectrum. In contrast to the standard inverse variables, consisting of eigenvalues and norming constants, reduced tridiagonal matrices now lie in the interior of some chart. Bidiagonal coordinates yield therefore an explicit atlas for TΛ...
متن کاملThe Godunov–Inverse Iteration: A Fast and Accurate Solution to the Symmetric Tridiagonal Eigenvalue Problem
We present a new hybrid algorithm based on Godunov’s method for computing eigenvectors of symmetric tridiagonal matrices and Inverse Iteration, which we call the Godunov–Inverse Iteration. We use eigenvectors computed according to Godunov’s method as starting vectors in the Inverse Iteration, replacing any nonnumeric elements of Godunov’s eigenvectors with random uniform numbers. We use the rig...
متن کامل