Compensated de Casteljau algorithm in \(K\) times the working precision

DOI10.1016/j.amc.2019.03.047zbMath1429.65037arXiv1808.10387OpenAlexW2889493128WikidataQ128120555 ScholiaQ128120555MaRDI QIDQ2009574

Danny Hermes

Publication date: 29 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.10387

zbMATH Keywords

round-off errorBernstein polynomialfloating-point arithmeticpolynomial evaluationcompensated algorithmerror-free transformation

Mathematics Subject Classification ID

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

Uses Software

• mctoolbox
• ORTHOPOLY

Cites Work

• Unnamed Item
• Unnamed Item
• Accurate evaluation of a polynomial and its derivative in Bernstein form
• Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form
• Algorithms for accurate, validated and fast polynomial evaluation
• On the numerical condition of polynomials in Bernstein form
• Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm
• Error analysis of corner cutting algorithms
• \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives
• A floating-point technique for extending the available precision
• Accuracy and Stability of Numerical Algorithms
• Accurate Sum and Dot Product

This page was built for publication: Compensated de Casteljau algorithm in \(K\) times the working precision