Skip to main content
Log in

On the convergence of theQR algorithm with multishifts

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. V. N. Kublanovskaya, “On some algorithms for the complete eigenvalue problem,”Zh. Vychisl. Mat. Mat. Fiz.,3, 637–657 (1961).

    Google Scholar 

  2. 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).

    Article  MATH  MathSciNet  Google Scholar 

  3. Z. Bai and J. Demmel, “On a block implementation of the Hessenberg multishiftQR iteration,”Int. J. High Speed Comput.,19, 197–112 (1989).

    Google Scholar 

  4. D. S. Watkins, “Shifting strategies for the parallelQR algorithm problem,”SIAM J. Sci. Stat. Comput.,15, No. 4, 953–958 (1991).

    MathSciNet  Google Scholar 

  5. D. S. Watkins and L. Elsner, “Convergence of algorithms of decomposition type for the eigenvalue problem”.Linear Algebra Appl.,143, 19–47 (1991).

    Article  MathSciNet  Google Scholar 

  6. J. H. Wilkinson, “Convergence of the LR, QR, and related algorithms,”Comp. J.,8 (1), 77–84 (1965).

    MATH  MathSciNet  Google Scholar 

  7. V. V. Voevodin,Numerical Foundations of Linear Algebra [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  8. Kh. D. Ikramov,Nonsymmetric Eigenvalue Problem [in Russian], Nauka, Moscow (1991).

    Google Scholar 

  9. E. E. Tyrtyshnikov,Brief Course of Numerical Analysis [in Russian], VINITI (1994).

  10. G. H. Golub and C. F. Van Loan,Matrix Computations, The Johns Hopkins University Press (1989).

Download references

Authors

Additional information

Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 229, 1995, pp. 275–283.

Translated by E. E. Tyrtyshnikov.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02355377

Keywords

Navigation