TY  - JOUR
AB  - A generic chasing algorithm for the matrix eigenvalue problem is introduced and studied. This algorithm includes, as special cases, the implicit, multiple-step QR and LR algorithms and similar bulge-chasing algorithms for the standard eigenvalue problem. The scope of the generic chasing algorithm is quite broad; it encompasses a number of chasing algorithms that cannot be analyzed by the traditional (e.g., implicit Q theorem) approach. These include the LR algorithm with partial pivoting and other chasing algorithms that employ pivoting for stability, as well as hybrid algorithms that combine elements of the LR and QR algorithms. The main result is that each step of the generic chasing algorithm amounts to one step of the generic GR algorithm. Therefore the convergence theorems for GR algorithms that were proven in a previous work [D. S. Watkins and L. Elsner, Linear Algebra Appl., 143 (1991), pp. 19–47] also apply to the generic chasing algorithm.
DA  - 1991
DO  - 10.1137/0612027
KW  - Subspace iteration
KW  - Chasing the bulge
KW  - GR algorithm
KW  - QR algorithm
KW  - Eeigenvalue
LA  - eng
IS  - 2
M2  - 374
PY  - 1991
SN  - 0895-4798
SP  - 374-384
T2  - SIAM Journal on matrix analysis and applications
TI  - Chasing Algorithmus for the Eigenvalue Problem
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-17762179
Y2  - 2024-11-25T07:05:14
ER  -