Abstract
We present a new fast and efficient algorithm for computing the eigenvalues and eigenvectors of large-size nondefective complex symmetric matrices. Our work was motivated by the emergence of this problem in recent methods for solving chemical reactive problems. The algorithm we present is similiar to the QR (QL) algorithm for complex Hermitian matrices, but we use complex orthogonal (not unitary) transformations. The new algorithm is faster by an order of magnitude than the corresponding EISPACK routine, and is also more amenable for modern parallel and vector supercomputers. We further present improved perturbation bounds for the Householder transformation, which lies at the basis of the whole transformation.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
