|
Zapiski Nauchnykh Seminarov POMI, 1995, Volume 229, Pages 275–283
(Mi znsl1719)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On the convergence of the $QR$ algorithm with multishifts
E. E. Tyrtyshnikov Institute of Numerical Mathematics, Russian Academy of Sciences
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.
Received: 20.06.1995
Citation:
E. E. Tyrtyshnikov, “On the convergence of the $QR$ algorithm with multishifts”, Computational methods and algorithms. Part XI, Zap. Nauchn. Sem. POMI, 229, POMI, St. Petersburg, 1995, 275–283; J. Math. Sci. (New York), 89:6 (1998), 1768–1774
Linking options:
https://www.mathnet.ru/eng/znsl1719 https://www.mathnet.ru/eng/znsl/v229/p275
|
Statistics & downloads: |
Abstract page: | 500 | Full-text PDF : | 281 |
|