Error analysis of corner cutting algorithms

DOI10.1023/A:1019190220312MaRDI QIDQ1964056zbMATH OpenFDO

Authors J. M. Peña, Esmeralda Mainar

Publication date 19 March 2000

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1019190220312

zbMATH Keywords

complexitycorner cutting algorithmserror analysisevaluation of functions

Mathematics Subject Classification ID

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

Review text

This paper is a systematic study of backward and forward error analysis for general corner cutting algorithms (evaluation of values of functions by convex combinations in each step). A modification is suggested that gives an estimate of an error, at the same time as the computed value, without significantly increasing complexity of the algorithm.

Recommendations

• Corner cutting systems
• Cutting corners always works
• Convergence analysis of corner cutting algorithms refining nets of functions
• Corner cutting evaluation algorithms for general rational curves
• Rounding Error Analysis of Interval Algorithms

Cited in

(20)

• Convergence analysis of corner cutting algorithms refining nets of functions
• Compensated de Casteljau algorithm in \(K\) times the working precision
• A shape preserving corner cutting algorithm with an enhanced accuracy
• Corner cutting evaluation algorithms for general rational curves
• On the generalized Ball bases
• Evaluation of the derivative of a polynomial in Bernstein form
• Corner cutting systems
• Accurate computations and applications of some classes of matrices
• Algorithm 960
• Shape preserving alternatives to the rational Bézier model
• On the accuracy of de Casteljau-type algorithms and Bernstein representations
• Accurate evaluation of a polynomial and its derivative in Bernstein form
• An evaluation algorithm for q-Bézier triangular patches formed by convex combinations
• Positivity, accuracy, optimality and applications
• Recent advances on accuracy, stability and optimality of B-bases
• Accurate determinant computation of Cauchy-polynomial matrices
• Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form
• Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form
• Error analysis of efficient evaluation algorithms for tensor product surfaces
• Roundoff errors for polynomial evaluation by a family of formulae

Describes a project that uses

Uses Software

• mctoolbox

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964056)