Name
Abstract | ||
|---|---|---|
This paper presents a compensated algorithm to accurately evaluate a polynomial expressed in Chebyshev basis of the first and second kind with floating-point coefficients. The principle is to apply error-free transformations to improve the traditional Clenshaw algorithm. The new algorithm is as accurate as the Clenshaw algorithm performed in twice the working precision. Forward error analysis and numerical experiments illustrate the accuracy and properties of the proposed algorithm. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.amc.2011.04.054 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Chebyshev polynomials,Compensated algorithm,Polynomial evaluation,Clenshaw algorithm,Error-free transformation,Round-off error | Chebyshev nodes,Chebyshev polynomials,Mathematical optimization,Ramer–Douglas–Peucker algorithm,Polynomial,Floating point,Round-off error,Clenshaw algorithm,Chebyshev filter,Mathematics | Journal |
Volume | Issue | ISSN |
217 | 23 | 0096-3003 |
Citations | PageRank | References |
9 | 0.69 | 10 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao Jiang | 1 | 111 | 18.12 |
| Roberto Barrio | 2 | 64 | 12.04 |
| Housen Li | 3 | 34 | 4.45 |
| Xiangke Liao | 4 | 622 | 74.79 |
| Lizhi Cheng | 5 | 290 | 34.84 |
| Su Fang | 6 | 61 | 5.73 |