Running relative error for the evaluation of polynomials

DOI10.1137/080745249MaRDI QIDQ3162136zbMATH OpenOpenAlexFDO

Authors J. Delgado, J. M. Peña

Publication date 19 October 2010

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/080745249

zbMATH Keywords

Bernstein basisClenshaw algorithmsconditioningde Casteljau algorithmHorner algorithmnested-type algorithmsnumerical experimentspolynomial evaluationrunning relative error analysis

Mathematics Subject Classification ID

Elementary functions (26A09) Computer-aided design (modeling of curves and surfaces) (65D17) Computation of special functions and constants, construction of tables (65D20) Roundoff error (65G50)

Recommendations

• Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form
• On the multivariate Horner scheme. II: Running error analysis
• A unified rounding error bound for polynomial evaluation
• Error analysis of efficient evaluation algorithms for tensor product surfaces
• Roundoff errors for polynomial evaluation by a family of formulae

Cited in

(20)

• A unified rounding error bound for polynomial evaluation
• Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm
• On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis
• Recursive de Casteljau bisection and rounding errors
• Tests for the recognition of total positivity
• Accurate computations and applications of some classes of matrices
• scientific article; zbMATH DE number 7377050 (Why is no real title available?)
• Dynamic Evaluation of Exponential Polynomial Curves and Surfaces via Basis Transformation
• Algorithm 960
• On the multivariate Horner scheme. II: Running error analysis
• On the accuracy of de Casteljau-type algorithms and Bernstein representations
• An evaluation algorithm for q-Bézier triangular patches formed by convex combinations
• Accurate algebra and error analysis for geometric r -Frank matrices
• Perturbation theory and error analysis for the Cauchy formula
• Positivity, accuracy, optimality and applications
• Recent advances on accuracy, stability and optimality of B-bases
• Accurate spectral computations and error analysis for r-geometric Min and Max matrices
• Accurate determinant computation of Cauchy-polynomial matrices
• Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form
• Roundoff errors for polynomial evaluation by a family of formulae

This page was built for publication: Running relative error for the evaluation of polynomials

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