SIAM Journal on Matrix Analysis and Applications vol:33 issue:3 pages:759-779
Recently a generalization of Francis’s implicitly shifted QR-algorithm was proposed, notably widening the class of matrices admitting low-cost implicit QR-steps. This unifying framework covered the methods and theory for Hessenberg and inverse Hessenberg matrices and furnished also new, single-shifted, QR-type methods for, e.g., CMV -matrices. Convergence of this approach was only suggested by numerical experiments. No theoretical claims supporting the results were presented. In this paper we present multishift variants of these new algorithms. We also provide a convergence theory that shows that the new algorithm performs nested subspace iterations on rational Krylov subspaces. Numerical experiments confirm the validity of the theory.