Abstract
We present a procedure for computing the coefficients of the expansion of a bivariate polynomial into Bernstein polynomials over subtriangles. These triangles are generated by partitioning the unit triangle. The coefficients are computed directly from the coefficients on the subdivided triangle from the preceding subdivision level. This allows a recursive computation of the coefficients and facilitates the economical computation of bounds for the range of a bivariate polynomial over a given triangle.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
