A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line (Q413531): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ARPACK / rank | |||
Normal rank | |||
Revision as of 20:21, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line |
scientific article |
Statements
A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line (English)
0 references
7 May 2012
0 references
The authors analyze a method for computing eigenvalues of a large sparse generalized eigenvalue problem \(Ax=\lambda Bx\), closest to the imaginary axis. Their method is based on inverse subspace iteration on the Lyapunov problem. They also show the link between inverse subspace iteration and implicitly restarted Arnoldi process through the extra projection step which corresponds to the decrease of the Krylov subspace dimension by executing \(QR\)-steps.
0 references
Lyapunov eigenvalue problem
0 references
Kronecker eigenvalue problem
0 references
eigenvalues closest to the imaginary axis
0 references
implicitly restarted Arnoldi method
0 references
large sparse generalized eigenvalue problem
0 references
inverse subspace iteration
0 references
Krylov subspace
0 references
