Abstract
Suppose that the generalized QR algorithm exploits polynomials f k (multi- shifts) of the same degree r on every step.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D.S. Watkins. Shifting strategies for the parallel QR-algorithm. SIAM J. Sci. Comput. 15(4): 953–958 (1994).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tyrtyshnikov, E.E. (1997). Lecture 11. In: A Brief Introduction to Numerical Analysis. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8136-4_11
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8136-4_11
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6413-2
Online ISBN: 978-0-8176-8136-4
eBook Packages: Springer Book Archive
Keywords
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.