Fast Parallel Algorithm for Polynomial Evaluation

Abstract

We present a new efficient parallel algorithm for polynomial evaluation based on a previously introduced divide-and-conquer method for solving linear recurrence systems with constant coefficients, which is formulated in terms of the level 1 BLAS (Basic Linear Algebra Subprograms) routine AXPY. We also discuss its platform-independent implementation with OpenMP and finally present the results of experiments performed on a dual processor Pentium III computer running under Linux operating system with Altas as an efficient implementation of BLAS. The sequential version of the algorithm is up to three times faster than the Horner's scheme.