Summary
We introduce and analyze generalized shift strategies for theLR algorithm and prove that these strategies are generalizations of classical iterations for non-linear equations. We also study how certain matrix functions transform under theLR algorithm.
Similar content being viewed by others
References
Bauer, F. L. Numerische Abschätzung und Berechnung von Eigenwerten nichtsymmetrischer Matrizen Aplikace Matematiky.10, 178–189 (1965).
Dekker, T. J., Traub, J. F.: The shiftedQR algorithm for Hermitian matrices. Lin. Alg. and its Appl. 4, 137–154 (1971).
Dekker, T. J., Traub, J. F. An analysis of the shifted,QR algorithm. In preparation.
Householder, A. S.: The, theory of matrices in numerical analysis. Blaisdell 1964.
Jenkins, M. A., Traub, J. F.: A three-stage variable shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration. Numerische Mathematik14, 256–263 (1970).
Schröder, E.: Über unendlich viele Algorithmen zur Auflösung der Gleichungen. Math. Ann.2, 317–365 (1870).
Wilkinson, J. H.: The algebraic eigenvalue problem. Clarendon Press 1965.
Author information
Authors and Affiliations
Additional information
This paper is based on work done while T. J. Dekker was visiting Bell Telephone Laboratories, Incorporated.
Some of the material in this paper was presented by J. F. Traub in an invited talk at the Gatlinburg Symposium on Numerical Algebra, April 1969.
Rights and permissions
About this article
Cite this article
Dekker, T.J., Traub, J.F. An analysis of the shiftedLR algorithm. Numer. Math. 17, 179–188 (1971). https://doi.org/10.1007/BF01436374
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01436374