Truncated \(QZ\) methods for large scale generalized eigenvalue problems (Q1279542): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: JDQZ / rank | |||
Normal rank |
Revision as of 01:48, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Truncated \(QZ\) methods for large scale generalized eigenvalue problems |
scientific article |
Statements
Truncated \(QZ\) methods for large scale generalized eigenvalue problems (English)
0 references
8 February 1999
0 references
This paper presents three methods for the large scale generalized eigenvalue problem \(Ax= \lambda Bx\). The methods are developed within a Krylov subspace projection framework as truncations of the QZ-algorithm for dense problems. These techniques provide natural extensions of the implicitly restarted Arnoldi method and the truncated RQ method for large scale generalized eigenvalue problems. These two methods require the accurate solution of linear systems at each step of the iteration. A two-block method is developed that incorporates \(k\) approximate Newton corrections at each iteration. Computational experience is presented to compare the three new methods.
0 references
generalized eigenvalue problem
0 references
Krylov projection methods
0 references
Arnoldi method
0 references
Lanczos method
0 references
preconditioning
0 references
implicit restarting
0 references
numerical examples
0 references
QZ-algorithm
0 references
two-block method
0 references