Stability of parallel algorithms to eval
โ
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