Error analysis of efficient evaluation algorithms for tensor product surfaces (Q935777)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Error analysis of efficient evaluation algorithms for tensor product surfaces |
scientific article; zbMATH DE number 5309287
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Error analysis of efficient evaluation algorithms for tensor product surfaces |
scientific article; zbMATH DE number 5309287 |
Statements
Error analysis of efficient evaluation algorithms for tensor product surfaces (English)
0 references
8 August 2008
0 references
The authors present the backward stability of the Casteljau algorithm and two efficient algorithms for polynomial tensor product surfaces. In addition, the conditioning of the corresponding bases are compared and a comparation with the corresponding Horner algorithm is presented. Finally, a running error analysis of the algorithms is carried out, and there are provided algorithms that calculate ``a posteriori'' sharp error bounds simultaneously to the evaluation of the surface without increasing the computational cost.
0 references
tensor product surfaces
0 references
evaluation algorithms
0 references
corner cutting algorithms
0 references
error analysis
0 references
backward stability
0 references
Casteljau algorithm
0 references
conditioning
0 references
Horner algorithm
0 references
0 references
0.91210085
0 references
0.86583126
0 references
0.85887706
0 references
0.85232735
0 references
0.8516809
0 references
0.8509766
0 references
0.8452388
0 references