Direct Algorithm for Bernstein Enclosure Boundary of Polynomials

Tareq Hamadneh, Hassan Al Zoubi, Ibraheem Abu Falahah, Mutaz Al-Sabbagh and R. U. Gobithaasan

Journal of Mathematics, 2022, vol. 2022, 1-8

Abstract: 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 of maximum degree L. To this end, we provide arithmetic operations and properties for obtaining a fast computational method of Bernstein coefficients. Furthermore, we give an algorithm for direct determination of the minimum and maximum Bernstein coefficients (enclosure boundary) in the simplicial multivariate case. Subsequently, the implicit form, monotonicity, and dominance cases are investigated.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/9156188.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/9156188.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:9156188

DOI: 10.1155/2022/9156188

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().