A unified rounding error bound for polynomial evaluation
From MaRDI portal
Recommendations
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- scientific article; zbMATH DE number 1206081
- Running relative error for the evaluation of polynomials
- Roundoff errors for polynomial evaluation by a family of formulae
- Error Bounds for Polynomial Evaluation and Complex Arithmetic
Cited in
(18)- On the numerical evaluation of linear recurrences
- Three term recurrence for the evaluation of multivariate orthogonal polynomials
- Accurate evaluation of polynomials in Legendre basis
- Recursive de Casteljau bisection and rounding errors
- Evaluation of the derivative of a polynomial in Bernstein form
- scientific article; zbMATH DE number 1574479 (Why is no real title available?)
- A general condition number for polynomials
- Certification of bounds on expressions involving rounded operators
- Accelerations of Zhao's methods for the numerical inversion of Laplace transform
- Running relative error for the evaluation of polynomials
- scientific article; zbMATH DE number 5124811 (Why is no real title available?)
- Error Bounds for Polynomial Evaluation and Complex Arithmetic
- The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
- Accurate evaluation of a polynomial in Chebyshev form
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Parameterizing intersecting surfaces via invariants
- Effective bounds for P-recursive sequences
This page was built for publication: A unified rounding error bound for polynomial evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1397303)
