Convergence of the LR, QR, and Related Algorithms

Abstract

Existing proofs of the convergence of the LR and QR algorithms are based on rather sophisticated determinantal theory and are to some extent incomplete. This paper gives elementary but completely general proofs of convergence of the LR, QR and two related algorithms. The proofs are intended to deal with the case when the matrix has non-linear elementary divisors.