Algorithms for polynomials in Bernstein form (Q1105314)
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 4058721
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for polynomials in Bernstein form |
scientific article; zbMATH DE number 4058721 |
Statements
Algorithms for polynomials in Bernstein form (English)
0 references
1988
0 references
The aim of this paper is to investigate the aspects of the formulation of geometric modeling algorithms in the Bernstein polynomial basis. Bernstein forms for various basic polynomial procedures required in such algorithms are developed and are found to be of similar complexity to their customary power forms. The condition of computation in floating point arithmetic of the power and Bernstein formulations is also examined.
0 references
polynomial algorithms
0 references
condition numbers
0 references
geometric modeling algorithms
0 references
Bernstein polynomial basis
0 references
floating point arithmetic
0 references
0 references
0.8228091597557068
0 references
0.8163182735443115
0 references
0.8163182735443115
0 references
0.814185380935669
0 references
0.8119663000106812
0 references
