Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
DOI10.1016/J.APNUM.2011.07.009zbMATH Open1227.65020OpenAlexW2005679388MaRDI QIDQ643356FDOQ643356
Authors: Hao Jiang, Roberto Barrio, Xiang-Ke Liao, Li-zhi Cheng 
Publication date: 28 October 2011
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2011.07.009
Recommendations
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Compensated de Casteljau algorithm in \(K\) times the working precision
- Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form
- Evaluation and approximate evaluation of the multivariate Bernstein-Bézier form on a regularly partitioned simplex
- Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form
numerical experimentsBernsteinbivariate polynomialde Casteljau algorithmcomputer aided geometric designround-off errorcompensated algorithmerror-free transformationBézier form
Cites Work
- Title not available (Why is that?)
- A Fortran 90-based multiprecision system
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate Sum and Dot Product
- A floating-point technique for extending the available precision
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- Algorithms for accurate, validated and fast polynomial evaluation
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Efficient evaluation of multivariate polynomials
- Evaluation and approximate evaluation of the multivariate Bernstein-Bézier form on a regularly partitioned simplex
- A unified approach to evaluation algorithms for multivariate polynomials
- Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form
- Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form
Cited In (9)
- Accurate and efficient evaluation of Chebyshev tensor product surface
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Fast and accurate evaluation of dual Bernstein polynomials
- Compensated de Casteljau algorithm in \(K\) times the working precision
- Accurate evaluation of a polynomial in Chebyshev form
- Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form
- Modified affine arithmetic in tensor form for trivariate polynomial evaluation and algebraic surface plotting
- Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form
- Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm
Uses Software
This page was built for publication: Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643356)
