Summary
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[BS] Batterson, S., Smillie, J.: Rayleigh quotient iteration for nonsymmetric matrices. Math. Comput.55, 169–178 (1990)
[F] Francis, J.: The QR transformation: a unitary analogue to the LR transformation. Parts I and II. Comput. J.4, 265–272, 332–345 (1961)
[GV] Golub, G., Van Loan, C.: Matrix computations, 2nd Ed. Baltimore: Johns Hopkins University Press 1989
[HJ] Horn, R., Johnson, C.: Matrix analysis. Cambridge University Press 1985
[MP] Martin, R., Peters, G., Wilkinson, J.: The QR algorithm for real Hessenberg matrices. Numer. Math.14, 219–231 (1970)
[P] Parlett, B.: Global convergence of the basic QR algorithm on Hessenberg matrices. Math. Comput.22, 803–817 (1968)
[PK] Parlett, B., Kahan, W.: On the convergence of a practical QR algorithm. In: Information Processing 68, Mathematical Software, sect 1, pp. 114–118. Amsterdam. North Holland 1969
[PW] Peters, G., Wilkinson, J.: Eigenvectors of real and complex matrices by LR and QR triangularizations. Numer. Math.16, 181–204 (1970)
[W] Watkins, D.: On GR algorithms for the eigenvalue problem. (preprint)
[WE] Watkins, D., Elsner, L.: Convergence of algorithms of decomposition type for the eigenvalue problem. (preprint)
Author information
Authors and Affiliations
Additional information
The author was partially supported by the NSF
Rights and permissions
About this article
Cite this article
Batterson, S. Convergence of the shifted QR algorithm on 3×3 normal matrices. Numer. Math. 58, 341–352 (1990). https://doi.org/10.1007/BF01385629
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01385629