Abstract
A unified treatment of the cases of quadratic and cubic convergence of the QR algorithm with multishifts is provided. The approach used is similar to that of Elsner and Watkins but does not use the notion of the distance between subspaces. Bibliography:10 titles.
Similar content being viewed by others
References
V. N. Kublanovskaya, “On some algorithms for the complete eigenvalue problem,”Zh. Vychisl. Mat. Mat. Fiz.,3, 637–657 (1961).
J. G. F. Francis, “The QR transformation: a unitary analogue to the LR transformation,” Parts I and II,Comp. J.,4, 265–272, 332–345 (1961).
Z. Bai and J. Demmel, “On a block implementation of the Hessenberg multishiftQR iteration,”Int. J. High Speed Comput.,19, 197–112 (1989).
D. S. Watkins, “Shifting strategies for the parallelQR algorithm problem,”SIAM J. Sci. Stat. Comput.,15, No. 4, 953–958 (1991).
D. S. Watkins and L. Elsner, “Convergence of algorithms of decomposition type for the eigenvalue problem”.Linear Algebra Appl.,143, 19–47 (1991).
J. H. Wilkinson, “Convergence of the LR, QR, and related algorithms,”Comp. J.,8 (1), 77–84 (1965).
V. V. Voevodin,Numerical Foundations of Linear Algebra [in Russian], Nauka, Moscow (1977).
Kh. D. Ikramov,Nonsymmetric Eigenvalue Problem [in Russian], Nauka, Moscow (1991).
E. E. Tyrtyshnikov,Brief Course of Numerical Analysis [in Russian], VINITI (1994).
G. H. Golub and C. F. Van Loan,Matrix Computations, The Johns Hopkins University Press (1989).
Additional information
Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 229, 1995, pp. 275–283.
Translated by E. E. Tyrtyshnikov.
Rights and permissions
About this article
Cite this article
Tyrtyshnikov, E.E. On the convergence of theQR algorithm with multishifts. J Math Sci 89, 1768–1774 (1998). https://doi.org/10.1007/BF02355377
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02355377