Fast Parallel Algorithm for Polynomial Evaluation

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.

[1]  Josep-Lluís Larriba-Pey,et al.  Review of General and Toeplitz Vector Bidiagonal Solvers , 1996, Parallel Comput..

[2]  H. Tal-Ezer High Degree Polynomial Interpolation in Newton Form , 1991, SIAM J. Sci. Comput..

[3]  Marcin Paprzycki,et al.  Parallel solution of linear recurrence systems , 1996 .

[4]  Giuseppe Fiorentino,et al.  On the parallel evaluation of a sparse polynomial at a point , 2004, Numerical Algorithms.

[5]  Przemyslaw Stpiczynski Parallel Algorithms for Solving Linear Recurrence Systems , 1992, CONPAR.

[6]  Yan Rui QUALITATIVE ANALYSIS FOR S POLYNOMIAL DIFFERENTISL SYSTEM OF HIGH DEGREE IN BIOCHEMICAL REACTIONS , 2001 .

[7]  Arnold Neumaier,et al.  Introduction to Numerical Analysis , 2001 .

[8]  H. A. van der Vorst,et al.  Vectorization of Linear Recurrence Relations , 1989 .

[9]  Przemyslaw Stpiczynski,et al.  A New Message Passing Algorithm for Solving Linear Recurrence Systems , 2001, PPAM.

[10]  Rohit Chandra,et al.  Parallel programming in openMP , 2000 .

[11]  Jack J. Dongarra,et al.  Automated empirical optimizations of software and the ATLAS project , 2001, Parallel Comput..

[12]  O Axelsson,et al.  A note on the vectorization of scalar recursions , 1986, Parallel Comput..

[13]  Howard Swann On solenoidal high‐degree polynomial approximations to solutions of the stationary Stokes equations , 2000 .

[14]  Roberto Barrio,et al.  On the numerical evaluation of linear recurrences , 2003 .

[15]  Lei Li,et al.  A Simple Parallel Algorithm for Polynomial Evaluation , 1996, SIAM J. Sci. Comput..

[16]  Jagdish J. Modi,et al.  Parallel algorithms and matrix computation , 1988 .

[17]  J. Ian Munro,et al.  Optimal Algorithms for Parallel Polynomial Evaluation , 1971, J. Comput. Syst. Sci..

[18]  Jack J. Dongarra,et al.  Solving linear systems on vector and shared memory computers , 1990 .

[19]  Yuefan Deng,et al.  New trends in high performance computing , 2001, Parallel Computing.