The DQR algorithm, basic theory, convergence, and conditional stability (Q1360724): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Frank Uhlig / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Andreas Frommer / rank | |||
Normal rank |
Revision as of 22:12, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The DQR algorithm, basic theory, convergence, and conditional stability |
scientific article |
Statements
The DQR algorithm, basic theory, convergence, and conditional stability (English)
0 references
23 July 1997
0 references
The work is dedicated to the general eigenvalue problem and discusses the DQR method as an alternative to the standard QR algorithm. The given dense matrix is reduced to general tridiagonal form (instead of Hessenberg form). For the iterative part D-orthogonal similarity transformations are used, which preserve the tridiagonal structure and thus allow computation of all eigenvalues with \(O(n^2)\) flop. Since the DQR method can be unstable the author proposes a hybrid algorithm, which switches to standard QR if application of DQR fails. The article contains theoretical investigations of convergence and stability behavior of the DQR method as well as exhaustive discussions of numerical examples.
0 references
unsymmetric eigenvalue problem
0 references
orthogonal reduction
0 references
QR algorithm
0 references
convergence
0 references
stability
0 references
numerical examples
0 references