Convergence of the Francis shifted QR algorithm on normal matrices

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.