Error Analysis for Polynomial Evaluation
From MaRDI portal
Publication:4044053
Cites work
Cited in
(10)- On the application of Newbery's transformation to the Reinsch polynomial evaluation scheme
- A stable method for the evaluation of a polynomial and of a rational function of one variable
- Rounding error propagation in polynomial evaluation schemes
- Rounding error analysis of Horner's scheme
- An algebraic approach to approximate evaluation of a polynomial on a set of real points
- On Stable Calculation of Linear Functionals
- Polynomial Evaluation Schemes
- Enclosing Chebyshev expansions in linear time
- Stability of parallel algorithms to evaluate Chebyshev series
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
This page was built for publication: Error Analysis for Polynomial Evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044053)