A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices (Q1326400)
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: A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices |
scientific article; zbMATH DE number 569123
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices |
scientific article; zbMATH DE number 569123 |
Statements
A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices (English)
0 references
7 July 1994
0 references
We describe a block version of Arnoldi's method for computing a few eigenvalues with largest or smallest real parts. The method is accelerated via Chebyshev iteration and a procedure is developed to identify the optimal ellipse which encloses the spectrum. A parallel implementation of this method is investigated on the eight processor Alliant FX/80. Numerical results and comparisons with simultaneous iteration on some Harwell-Boeing matrices are reported.
0 references
numerical results
0 references
eigenvectors
0 references
sparse matrices
0 references
parallel computation
0 references
Arnoldi's method
0 references
eigenvalues
0 references
Chebyshev iteration
0 references
0 references
