Suppose that the generalized QR algorithm exploits polynomials f k (multi- shifts) of the same degree r on every step.


Unitary Matrice Quadratic Convergence Hessenberg Matrix Tridiagonal Matrice Real Entry 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D.S. Watkins. Shifting strategies for the parallel QR-algorithm. SIAM J. Sci. Comput. 15(4): 953–958 (1994).MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Eugene E. Tyrtyshnikov
    • 1
  1. 1.Institute of Numerical MathematicsRussian Academy of SciencesMoscowRussia

Personalised recommendations