On the degree elevation of Bernstein polynomial representation (Q556280)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2175290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the degree elevation of Bernstein polynomial representation |
scientific article; zbMATH DE number 2175290 |
Statements
On the degree elevation of Bernstein polynomial representation (English)
0 references
13 June 2005
0 references
The author introduces new algorithms for degree elevation of Bernstein polynomial representations. Also, a very complete analysis and a discussion of the new and of most of the known algorithms of this kind are presented. In addition, based on the obtained results for the conditioning of degree evaluation matrices, the author also analyzes the accuracy of the new algorithms. Finally, I would like to mention that the introduction of the paper, although short, gives a nice description of the most important reasons that motivate the necessity of developing degree evaluation algorithms for Bernstein polynomial representations.
0 references
computer aided geometric design
0 references
degree elevation algorithms
0 references
Bernstein polynomials
0 references
conditioning
0 references
0 references
0.8421664834022522
0 references
0.8230617046356201
0 references
0.7992867231369019
0 references
