On the degree elevation of Bernstein polynomial representation (Q556280): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.cam.2004.11.012 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.CAM.2004.11.012 / rank | |||
Normal rank |
Latest revision as of 21:27, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the degree elevation of Bernstein polynomial representation |
scientific article |
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