A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices

DOI10.1137/S0895479894137639zbMath0842.65024MaRDI QIDQ4870624

Ralph A. Willoughby, Jane K. Cullum

Publication date: 27 March 1996

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

\(QR\) factorizationcomplex symmetric tridiagonal matrices\(QL\) factorization

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

Fast parameterized inexact Uzawa method for complex symmetric linear systems ⋮ A fast method to diagonalize a Hankel matrix ⋮ A class of accelerated parameterized inexact Uzawa algorithms for complex symmetric linear systems ⋮ General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗ ⋮ On tridiagonal matrices unitarily equivalent to normal matrices ⋮ An iterative method for solving the spectral problem of complex symmetric matrices ⋮ A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices ⋮ A hybrid iterative method for symmetric indefinite linear systems ⋮ A fast eigenvalue algorithm for Hankel matrices ⋮ Diagonalization of complex symmetric matrices: generalized Householder reflections, iterative deflation and implicit shifts ⋮ A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem

Uses Software

• Harwell-Boeing sparse matrix collection