Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035)
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: Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems |
scientific article; zbMATH DE number 1084079
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems |
scientific article; zbMATH DE number 1084079 |
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
0 references
0 references
0 references
0.91269016
0 references
0 references
0.9019308
0 references
0.9008096
0 references
0 references
0.89429885
0 references
