A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
Authors:
- Kensuke AishimaKAKensuke Aishima
- Takayasu MatsuoTMTakayasu Matsuo
- Kazuo MurotaKMKazuo Murota
- Masaaki SugiharaMSMasaaki Sugihara
- 1 September 2012
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 236 (15) , 3556-3560
Abstract
No abstract availableKeywords
Funding Information
- Global Center of Excellence
- Research Fellowship of the Japan Society for the Promotion of Science for Young Scientists
This publication has 15 references indexed in Scilit:
- An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank MatricesSIAM Journal on Scientific Computing, 2010
- A multiple shift -step for structured rank matricesJournal of Computational and Applied Mathematics, 2010
- The QR Algorithm RevisitedSIAM Review, 2008
- Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue ProblemSIAM Journal on Matrix Analysis and Applications, 2006
- The Multishift QR Algorithm. Part II: Aggressive Early DeflationSIAM Journal on Matrix Analysis and Applications, 2002
- The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 PerformanceSIAM Journal on Matrix Analysis and Applications, 2002
- QR-like algorithms for eigenvalue problemsJournal of Computational and Applied Mathematics, 2000
- A Parallel QR Algorithm for the Symmetrical Tridiagonal Eigenvalue ProblemJournal of Parallel and Distributed Computing, 1994
- Convergence of algorithms of decomposition type for the eigenvalue problemLinear Algebra and its Applications, 1991
- ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATIONInternational Journal of High Speed Computing, 1989