Abstract

An algorithm is given for computing the eigenvalues and (optionally) the eigenvectors of either a skew-symmetric matrix or a symmetric tridiagonal matrix with constant diagonal. The algorithm uses only orthogonal similarity transformations, and is believed to be the most efficient algorithm available for computing all the eigenvalues or the complete eigensystem. 2 tables.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call