๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Stability of parallel algorithms for polynomial evaluation

โœ Scribed by R. Barrio; P. Yalamov

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
785 KB
Volume
46
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal algorithms for parallel polynomi
Optimal algorithms for parallel polynomial evaluation
โœ Ian Munro; Michael Paterson ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmetic processors are presented. It is shown that, provided the degree of the polynomial to be evaluated exceeds k[Iog2 k], an algorithm given is within one time unit of optimality.

Stability of parallel algorithms to eval
Stability of parallel algorithms to evaluate Chebyshev series
โœ R. Barrio ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 644 KB

In this paper, we present rounding error bounds of recent parallel versions of Forsythe's and Clenshaw's algorithms for the evaluation of finite series of Chebyshev polynomials of-the first and second kind. The backward errors are studied by using the matrix formulation of the algorithm, whereas the

Data parallel evaluation of univariate p
Data parallel evaluation of univariate polynomials by the Knuth-Eve algorithm
โœ R.E. Overill; S. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 797 KB

The performance of the Knuth-Eve algorithm for data parallel evaluation of univariate polynomials of degree 8, 16 and 32 has been systematically compared with that of the classical Newton-Homer algorithm using three vector processors and three processor arrays. Significant performance improvements h