Abstract
We examine global convergence properties of the Francis shifted QR algorithm on real, normal Hessenberg matrices. It is shown that the algorithm will almost always produce a decoupling. Eigenvalue conditions are identified which assure decoupling. In particular a sufficient condition is that a normal matrix has more than four real eigenvalues.
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.
