Accurate evaluation of a polynomial and its derivative in Bernstein form

DOI10.1016/j.camwa.2010.05.021zbMath1201.65028OpenAlexW2043650433MaRDI QIDQ611362

Fang Su, Hao Jiang, Li-Zhi Cheng, Sheng-Guo Li

Publication date: 14 December 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.05.021

zbMATH Keywords

round-off errorBernstein polynomialpolynomial evaluationcompensated algorithmerror-free transformationderivative evaluation

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (10)

On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots ⋮ Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form ⋮ Accurate quotient-difference algorithm: error analysis, improvements and applications ⋮ Accurate and efficient evaluation of Chebyshev tensor product surface ⋮ Compensated de Casteljau algorithm in \(K\) times the working precision ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ Numerical validation of compensated algorithms with stochastic arithmetic ⋮ An accurate algorithm for evaluating rational functions ⋮ Accurate evaluation of polynomials in Legendre basis ⋮ Algorithm 960

Uses Software

• mctoolbox
• XBLAS

Cites Work

• Unnamed Item
• Algorithms for accurate, validated and fast polynomial evaluation
• Accurate simple zeros of polynomials in floating point arithmetic
• On the numerical condition of polynomials in Bernstein form
• A unified rounding error bound for polynomial evaluation
• Basis conversions among univariate polynomial representations
• Error analysis of corner cutting algorithms
• A floating-point technique for extending the available precision
• Evaluation of the derivative of a polynomial in Bernstein form
• Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
• Accuracy and Stability of Numerical Algorithms
• Accurate Floating-Point Summation Part I: Faithful Rounding
• Design, implementation and testing of extended and mixed precision BLAS
• Accurate Sum and Dot Product

This page was built for publication: Accurate evaluation of a polynomial and its derivative in Bernstein form