THE RQR ALGORITHM∗

作     者：Camps, Daan Mach, Thomas Vandebril, Raf Watkins, David S. 

作者机构：National Energy Research Scientific Computing Center Lawrence Berkeley National Laboratory United States University of Potsdam Institute of Mathematics Karl-Liebknecht-Str. 24–25 Potsdam14476 Germany Department of Computer Science KU Leuven Belgium Department of Mathematics Washington State University United States 

出 版 物：《arXiv》 (arXiv)

年 卷 期：2024年

核心收录：

主　　题：Eigenvalues and eigenfunctions 

摘      要：Pole-swapping algorithms, generalizations of bulge-chasing algorithms, have been shown to be a viable alternative to the bulge-chasing QZ algorithm for solving the generalized eigenvalue problem for a matrix pencil A − λB. It is natural to try to devise a pole-swapping algorithm that solves the standard eigenvalue problem for a single matrix A. This paper introduces such an algorithm and shows that it is competitive with Francis’s bulge-chasing QR *** Codes 65F15, 15A18 © 2024, CC BY.