Arnoldi-Faber method for large non Hermitian eigenvalue problems (Q1381048): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| (3 intermediate revisions by one other user not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Schwarz-Christoffel / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: eigs / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: COCA / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 03:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Arnoldi-Faber method for large non Hermitian eigenvalue problems |
scientific article |
Statements
Arnoldi-Faber method for large non Hermitian eigenvalue problems (English)
0 references
15 March 1998
0 references
\textit{Y. Saad} [Math. Comp. 42, 567-588 (1984; Zbl 0539.65013)] and others have used Chebyshev polynomials to accelerate the convergence of the Arnoldi method for computing the right-most eigenvalues of large non Hermitian matrices. This paper describes how Faber polynomials, which were used by \textit{G. Starke} and \textit{R. S. Varga} [Numer. Math. 64, No. 2, 213-240 (1993; Zbl 0795.65015)] for the solution of linear systems, may also be used for the eigenvalue problem instead of Chebyshev polynomials. Numerical tests confirm the usefulness of the proposed method for the computation of eigenvalues and eigenvectors.
0 references
Faber polynomials
0 references
Krylov subspace method
0 references
block Arnoldi method
0 references
Schwarz-Christoffel method
0 references
Arnoldi-Faber method
0 references
large non Hermitian eigenvalue problems
0 references
convergence acceleration
0 references
