Implicitly restarted Arnoldi methods and subspace iteration (Q2784364)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Implicitly restarted Arnoldi methods and subspace iteration |
scientific article; zbMATH DE number 1732258
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implicitly restarted Arnoldi methods and subspace iteration |
scientific article; zbMATH DE number 1732258 |
Statements
23 April 2002
0 references
Arnoldi iteration
0 references
eigenvalues
0 references
implicitly restarted Arnoldi method
0 references
nonstationary simultaneous iteration
0 references
subspace iteration
0 references
QR-algorithm
0 references
numerical examples
0 references
Implicitly restarted Arnoldi methods and subspace iteration (English)
0 references
The paper is concerned with the relation of three methods for computing several eigenvalues of a matrix. 1. An implicitly restarted Arnoldi method. 2. Nonstationary simultaneous iteration (subspace iteration). 3. QR-algorithm. Numerical examples show that the first method can be much faster than the second one.
0 references
