Abstract
The QR-algorithm is a popular numerical method for the computation of eigenvalues of matrices. All eigenvalues of a general n× n upper Hessenberg matrix typically can be computed in O(n 3) arithmetic floating point operations using O(n 2) storage locations. When the upper Hessenberg matrix is Hermitian or unitary, then it can be represented by O(n) parameters, and there are variants of the QR-algorithm that reduce the operation count for computing all eigenvalues to O(n 2) arithmetic floating point operations and the storage requirement to O(n) locations. However, for many structured matrices that can be represented with O(n) storage locations, available implementations of the QR-algorithm require O(n 3) arithmetic floating point operations and O(n 2) storage locations to determine all eigenvalues. This note shows that for some of the latter matrices, the operation count can be reduced to O(n 2) arithmetic floating point operations and the memory requirement to O(n) storage locations by periodically restarting the QR-algorithm.
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.
