Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations Original Research Article

This paper presents explicit formulas and algorithms to compute the eigenvalues and eigenvectors of order-one-quasiseparable matrices. Various recursive relations for characteristic polynomials of their principal submatrices are derived. The cost of evaluating the characteristic polynomial of an N × N matrix and its derivative is only O(N). This leads immediately to several versions of a fast quasiseparable Newton iteration algorithm. In the Hermitian case we extend the Sturm property to the characteristic polynomials of order-one-quasiseparable matrices which yields to several versions of a fast quasiseparable bisection algorithm. Conditions guaranteeing that an eigenvalue of a order-one-quasiseparable matrix is simple are obtained, and an explicit formula for the corresponding eigenvector is derived. The method is further extended to the case when these conditions are not fulfilled. Several particular examples with tridiagonal, (almost) unitary Hessenberg, and Toeplitz matrices are considered. The algorithms are based on new three-term and two-term recurrence relations for the characteristic polynomials of principal submatrices of order-one-quasiseparable matrices R. It turns out that the latter new class of polynomials generalizes and includes two classical families: (i) polynomials orthogonal on the real line (that play a crucial role in a number of classical algorithms in numerical linear algebra), and (ii) the Szegö polynomials (that play a significant role in signal processing). Moreover, new formulas can be seen as generalizations of the classical three-term recurrence relations for the real orthogonal polynomials and of the two-term recurrence relations for the Szegö polynomials.