Accurate evaluation of a polynomial in Chebyshev form (Q555368)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5931325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accurate evaluation of a polynomial in Chebyshev form |
scientific article; zbMATH DE number 5931325 |
Statements
Accurate evaluation of a polynomial in Chebyshev form (English)
0 references
22 July 2011
0 references
The authors propose a compensated Clenshaw algorithm to evaluate a polynomial in Chebyshev form, based on error-free transformations. Forward error bounds are established and numerical tests illustrate the efficiency of the new method for evaluating the polynomial in the neighborhood of a multiple root and near the ends of the standard interval.
0 references
Chebyshev polynomials
0 references
compensated algorithm
0 references
polynomial evaluation
0 references
Clenshaw algorithm
0 references
error-free transformation
0 references
round-off error
0 references
numerical examples
0 references
0 references
0 references
0 references
0.8909847140312195
0 references
0.8416970372200012
0 references
0.8215879201889038
0 references
0.8206908702850342
0 references
0.806996762752533
0 references
