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

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...

Full description

Saved in:
Bibliographic Details
Published inComputing Vol. 77; no. 1; pp. 97 - 111
Main Authors Mainar, E., Peña, J. M.
Format Journal Article
LanguageEnglish
Published Wien Springer 01.02.2006
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN0010-485X
1436-5057
DOI10.1007/s00607-005-0149-8

Cover

More Information
Summary: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. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0010-485X
1436-5057
DOI:10.1007/s00607-005-0149-8