Stability of parallel algorithms to evaluate Chebyshev series (Q5948792)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stability of parallel algorithms to evaluate Chebyshev series |
scientific article; zbMATH DE number 1672016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stability of parallel algorithms to evaluate Chebyshev series |
scientific article; zbMATH DE number 1672016 |
Statements
Stability of parallel algorithms to evaluate Chebyshev series (English)
0 references
12 November 2001
0 references
The rounding error bounds of the parallel versions of Forsythe's and Clenshaw's algorithms for the evaluation of finite series of Chebyshev polynomials are studied. Both backward and forward errors are studied and a stable behavior is proved. Several numerical tests are presented to compare the theoretical bounds and the simulated rounding errors.
0 references
roundoff error
0 references
parallel algorithm
0 references
polynomial evaluation
0 references
stability
0 references
Forsythe algorithm
0 references
Clenshaw algorithm
0 references
parallel computation
0 references
numerical examples
0 references
error bounds
0 references
Chebyshev polynomials
0 references
0 references
0.869434118270874
0 references
0.8694339394569397
0 references
0.8553780913352966
0 references
0.8535664677619934
0 references
