Chasing Algorithmus for the Eigenvalue Problem

Watkins DS, Elsner L (1991)
SIAM Journal on matrix analysis and applications 12(2): 374-384.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
OA
Autor*in
Watkins, David S.; Elsner, LudwigUniBi
Abstract / Bemerkung
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.
Stichworte
Subspace iteration; Chasing the bulge; GR algorithm; QR algorithm; Eeigenvalue
Erscheinungsjahr
1991
Zeitschriftentitel
SIAM Journal on matrix analysis and applications
Band
12
Ausgabe
2
Seite(n)
374-384
ISSN
0895-4798
eISSN
1095-7162
Page URI
https://pub.uni-bielefeld.de/record/1776217

Zitieren

Watkins DS, Elsner L. Chasing Algorithmus for the Eigenvalue Problem. SIAM Journal on matrix analysis and applications. 1991;12(2):374-384.
Watkins, D. S., & Elsner, L. (1991). Chasing Algorithmus for the Eigenvalue Problem. SIAM Journal on matrix analysis and applications, 12(2), 374-384. doi:10.1137/0612027
Watkins, D. S., and Elsner, L. (1991). Chasing Algorithmus for the Eigenvalue Problem. SIAM Journal on matrix analysis and applications 12, 374-384.
Watkins, D.S., & Elsner, L., 1991. Chasing Algorithmus for the Eigenvalue Problem. SIAM Journal on matrix analysis and applications, 12(2), p 374-384.
D.S. Watkins and L. Elsner, “Chasing Algorithmus for the Eigenvalue Problem”, SIAM Journal on matrix analysis and applications, vol. 12, 1991, pp. 374-384.
Watkins, D.S., Elsner, L.: Chasing Algorithmus for the Eigenvalue Problem. SIAM Journal on matrix analysis and applications. 12, 374-384 (1991).
Watkins, David S., and Elsner, Ludwig. “Chasing Algorithmus for the Eigenvalue Problem”. SIAM Journal on matrix analysis and applications 12.2 (1991): 374-384.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T08:48:20Z
MD5 Prüfsumme
74004d3833e6d9b14d46004b3efd97ae