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

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.