A parallel algorithm to evaluate chebyshev series on a message passing environment

SIAM Journal on Scientific Computing

Volumn 20, Issue 3, 1998, Pages 964-969

  Barrio, Roberto ^a,b,c   Sabadell, Javier ^a,d  

^a UNIVERSITY OF ZARAGOZA   (Spain)

^b Civil Engineering School   (Spain)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^d NONE   (Spain)

Author keywords

Chebyshev polynomials; Parallel algorithm; Polynomial evaluation

Indexed keywords

CHEBYSHEV POLYNOMIALS; MESSAGE PASSING INTERFACE; MULTIPLE INPUT MULTIPLE DATA COMPUTERS;

CHEBYSHEV APPROXIMATION; COSINE TRANSFORMS; DATA COMMUNICATION SYSTEMS; INTERFACES (COMPUTER); NUMERICAL METHODS; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

PARALLEL ALGORITHMS;

EID: 0032226414     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827596312857     Document Type: Article

References (6)

1. G. W. CLENSHAW, A note on the summation of Chebyshev series, Math. Tab. Wash., 9 (1955), pp. 118-120.
2. W. S. DORN, Generalizations of Homer's rule for polynomial evaluation, IBM J. Res. Develop., 6 (1962), pp. 239-245.
3. G. B. FORSYTHE, Generation and use of orthogonal polynomials for data-fitting with a digital computer, J. Soc. Indust. Appl. Math, 5 (1957), pp. 74-88.
4. L. Li, J. Hu, AND T. NAKAMURA, A simple parallel algorithm for polynomial evaluation, SIAM J. Sei. Comput., 17 (1996), pp. 260-262.
5. K. MARUYAMA, On the parallel evaluation of polynomials, IEEE TVans. Computers., C-22 (1973), pp. 2-5.
6. J. I. MUNRO AND M. PATERSON, Optimal algorithms for parallel polynomial evaluation, J. Comput. System Sei., 7 (1973), pp. 189-198.