A QL procedure for computing the eigenvalues of complex symmetric tridiagonal matrices

Abstract

We present a storage efficient procedure for computing all of the eigenvalues of a complex symmetric tridiagonal matrix. This procedure mimics the implicit QL procedure for computing all of the eigenvalues of a real symmetric tridiagonal matrix, modified by heuristics for monitoring and maintaining numerical stability. Numerical experiments demonstrate the capabilities of this procedure.