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.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.