Convergence of the shifted QR algorithm on 3×3 normal matrices
- Cite this article as:
- Batterson, S. Numer. Math. (1990) 58: 341. doi:10.1007/BF01385629
- 112 Downloads
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.