Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form

DOI10.1016/J.APNUM.2011.07.009MaRDI QIDQ643356zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

numerical experimentsBernsteinbivariate polynomialde Casteljau algorithmcomputer aided geometric designround-off errorcompensated algorithmerror-free transformationBézier form

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

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

Cites work

• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• A Fortran 90-based multiprecision system
• A floating-point technique for extending the available precision
• A unified approach to evaluation algorithms for multivariate polynomials
• Accuracy and Stability of Numerical Algorithms
• Accurate Floating-Point Summation Part I: Faithful Rounding
• Accurate Sum and Dot Product
• Accurate evaluation of a polynomial and its derivative in Bernstein form
• Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
• Algorithms for accurate, validated and fast polynomial evaluation
• Efficient evaluation of multivariate polynomials
• 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

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

Describes a project that uses

Uses Software

• XBLAS
• LBNL
• mctoolbox

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)