, Volume 58, Issue 1, pp 341-352

Convergence of the shifted QR algorithm on 3×3 normal matrices

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


This paper concerns the convergence properties of the shifted QR algorithm on 3×3 normal, Hessenberg matrices. The algorithm is viewed as an iteration on one dimensional subspaces. A class of matrices is characterized for which HQR2 is unable to approximate a solution.

The author was partially supported by the NSF