1997

1998

Learn More

A simple parallel algorithm for the evaluation of polynomials written in the Chebyshev form is introduced. By this method only 2 ⌈log 2 (p − 2)⌉ + ⌈log 2 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. 1.… (More)

- ‹
- 1
- ›