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...
Saved in:
| Published in | Computing Vol. 77; no. 1; pp. 97 - 111 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Wien
Springer
01.02.2006
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0010-485X 1436-5057 |
| DOI | 10.1007/s00607-005-0149-8 |
Cover
| 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 |