Running Error Analysis of Evaluation Algorithms for Bivariate Polynomials in Barycentric Bernstein Form

Authors:
E. Mainar;M. Peña
Affiliations:
Dept. Mathematica, Universidad de Cantabria, Avenida. de los Castros s/n, 39005, Santander, Spain;Universidad de Zaragoza, Pedro Cerbuna 12, 50009, Zaragoza, Spain
Venue:
Computing
Year:
2006

Citing 6
Cited 3

Efficient evaluation of multivariate polynomials

Computer Aided Geometric Design
On the p-norm condition number of the multivariate triangular Bernstein basis

Journal of Computational and Applied Mathematics - Special issue/Dedicated to Prof. Larry L. Schumaker on the occasion of his 60th birthday
On the multivariate Horner scheme II: running error analysis

Computing
Accuracy and Stability of Numerical Algorithms

Accuracy and Stability of Numerical Algorithms
The Marching Intersections algorithm for merging range images

The Visual Computer: International Journal of Computer Graphics
Rounding Errors in Algebraic Processes

Rounding Errors in Algebraic Processes

Evaluation algorithms for multivariate polynomials in Bernstein--Bézier form

Journal of Approximation Theory
Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form

Applied Numerical Mathematics
On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis

Advances in Computational Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Running error analysis for the bivariate de Casteljau algorithm and the VS algorithm is performed. Theoretical results joint with numerical experiments show the better stability properties of the de Casteljau algorithm for the evaluation of bivariate polynomials defined on a triangle in spite of the lower complexity of the VS algorithm. The sharpness of our running error bounds is shown.