Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Harwell-Boeing sparse matrix collection / rank | |||
Normal rank | |||
Revision as of 07:48, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems |
scientific article |
Statements
Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (English)
0 references
1 March 1998
0 references
parallel computation
0 references
Krylov subspace
0 references
Arnoldi's method
0 references
Faber iterations
0 references
best uniform approximation
0 references
algorithm
0 references
large non-Hermitian eigenvalue problems
0 references
performance
0 references
machine Paragon
0 references
Chebyshev acceleration
0 references
