Error analysis of corner cutting algorithms

DOI10.1023/A:1019190220312zbMath0964.65008MaRDI QIDQ1964056

Juan Manuel Peña, Esmeralda Mainar

Publication date: 19 March 2000

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

complexityerror analysisevaluation of functionscorner cutting algorithms

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20)

Related Items (15)

Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form ⋮ Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form ⋮ Accurate evaluation of a polynomial and its derivative in Bernstein form ⋮ On the accuracy of de Casteljau-type algorithms and Bernstein representations ⋮ An evaluation algorithm for \(q\)-Bézier triangular patches formed by convex combinations ⋮ Error analysis of efficient evaluation algorithms for tensor product surfaces ⋮ Roundoff errors for polynomial evaluation by a family of formulae ⋮ Accurate Computations and Applications of Some Classes of Matrices ⋮ Compensated de Casteljau algorithm in \(K\) times the working precision ⋮ On the generalized Ball bases ⋮ Shape preserving alternatives to the rational Bézier model ⋮ Evaluation of the derivative of a polynomial in Bernstein form ⋮ Corner cutting systems ⋮ Corner cutting evaluation algorithms for general rational curves ⋮ Algorithm 960

Uses Software

• mctoolbox

This page was built for publication: Error analysis of corner cutting algorithms