Accurate evaluation of a polynomial and its derivative in Bernstein form
From MaRDI portal
Publication:611362
Recommendations
- Compensated de Casteljau algorithm in \(K\) times the working precision
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
- Evaluation of the derivative of a polynomial in Bernstein form
- Accurate evaluation of the k-th derivative of a polynomial and its application
- Accurate evaluation of a polynomial in Chebyshev form
Cites work
- A floating-point technique for extending the available precision
- A unified rounding error bound for polynomial evaluation
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate floating-point summation. II: Sign, K-fold faithful and rounding to nearest
- Accurate simple zeros of polynomials in floating point arithmetic
- Accurate Sum and Dot Product
- Algorithms for accurate, validated and fast polynomial evaluation
- Basis conversions among univariate polynomial representations
- Design, implementation and testing of extended and mixed precision BLAS
- Error analysis of corner cutting algorithms
- Evaluation of the derivative of a polynomial in Bernstein form
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- On the numerical condition of polynomials in Bernstein form
Cited in
(14)- Algorithms for polynomials in Bernstein form
- Accurate quotient-difference algorithm: error analysis, improvements and applications
- Accurate evaluation of the k-th derivative of a polynomial and its application
- Accurate and efficient evaluation of Chebyshev tensor product surface
- Compensated de Casteljau algorithm in \(K\) times the working precision
- Numerical validation of compensated algorithms with stochastic arithmetic
- An accurate algorithm for evaluating rational functions
- Accurate evaluation of polynomials in Legendre basis
- Evaluation of the derivative of a polynomial in Bernstein form
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
- scientific article; zbMATH DE number 883364 (Why is no real title available?)
- Algorithm 960
- Accurate evaluation of a polynomial in Chebyshev form
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
This page was built for publication: Accurate evaluation of a polynomial and its derivative in Bernstein form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q611362)