A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment

  • Authors:
  • Roberto Barrio;Javier Sabadell

  • Affiliations:
  • -;-

  • Venue:
  • SIAM Journal on Scientific Computing
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

A simple parallel algorithm for the evaluation of polynomials written in the Chebyshev form is introduced. By this method only 2[log2 (p-2)] + [log2 p + 4 N/p] - 7 steps on p processors are needed to evaluate a Chebyshev series of degree N. Theoretical analysis of the efficiency is performed and some numerical examples on a CRAY T3D are shown.