✦ LIBER ✦

Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems

✍ Scribed by Vincent Heuveline; Miloud Sadkane

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 730 KB
Volume: 82
Category: Article
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(97)00046-0

No coin nor oath required. For personal study only.

✦ Synopsis

We investigate the parallelization of an algorithm that computes the polynomial with minimal uniform norm on polygonal domains. The obtained polynomial is used to accelerate large non-Hermitian eigenvalue problems. We report the performance results obtained on the machine Paragon and compare this method with the one based on Chebyshev acceleration techniques.