A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
Jane Cullum, Ralph A. Willoughby
Abstract
Jane Cullum, Ralph A. Willoughby
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.
OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Tridiagonal matrix, Eigenvalues and eigenvectors, Tridiagonal matrix algorithm, Mathematics, Symmetric matrix, Matrix (chemical analysis), Heuristics, Applied mathematics