Direct Algorithm for Bernstein Enclosure Boundary of Polynomials
Multivariate polynomials of finite degree can be expanded into Bernstein form over a given simplex domain. The minimum and maximum Bernstein control points optimize the polynomial curve over the same domain. In this paper, we address methods for computing these control points in the simplicial case...
Saved in:
| Main Authors: | Tareq Hamadneh, Hassan Al Zoubi, Ibraheem Abu Falahah, Mutaz Al-Sabbagh |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/9156188 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Trigonometric Polynomial Like Bernstein Polynomial
by: Xuli Han
Published: (2014-01-01) -
Probabilistic degenerate Bernstein polynomials
by: Jinyu Wang, et al.
Published: (2025-12-01) -
A de Casteljau Algorithm for 𝑞-Bernstein-Stancu Polynomials
by: Grzegorz Nowak
Published: (2011-01-01) -
Transfinite Elements Using Bernstein Polynomials
by: Christopher Provatidis
Published: (2025-06-01) -
Some Identities on Bernstein Polynomials Associated with 𝑞-Euler Polynomials
by: A. Bayad, et al.
Published: (2011-01-01)