Bounds for the Range of a Bivariate Polynomial over a Triangle

The problem of finding an enclosure for the range of a bivariate polynomial p over the unit triangle is considered. The polynomial p is expanded into Bernstein polynomials. If p has only real coefficients the coefficients of this expansion, the so-called Bernstein coefficients, provide lower and upper bounds for the range. In the case that p has complex coefficients the convex hull of the Bernstein coefficients encloses the range. The enclosure is improved by subdividing the unit triangle into squares and triangles and computing enclosures for the range of p over these regions. It is shown that the sequence of enclosures obtained in this way converges to the convex hull of the range in the Hausdorff distance. Furthermore, it is described how the Bernstein coefficients on these regions can be computed economically.

[1]  Tim N. T. Goodman,et al.  Variation diminishing properties of Bernstein polynomials on triangles , 1987 .

[2]  Oved Shisha,et al.  The Bernstein form of a polynomial , 1966 .

[3]  R. Riesenfeld,et al.  Bounds on a polynomial , 1981 .

[4]  T. J. Rivlin,et al.  Ultra-arithmetic II: intervals of polynomials , 1982 .

[5]  J. Garlo,et al.  The Bernstein Algorithm , 1994 .

[6]  Jürgen Garloff,et al.  Speeding Up an Algorithm for Checking Robust Stability of Polynomials , 1997 .

[7]  Jürgen Garloff.  Convergent Bounds for the Range of Multivariate Polynomials , 1985, Interval Mathematics.

[8]  Nicholas M. Patrikalakis,et al.  Robust interval solid modelling Part I: representations , 1996, Comput. Aided Des..

[9]  Richard F. Riesenfeld,et al.  A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Sudhir P. Mudur,et al.  A new method of evaluating compact geometric bounds for use in subdivision algorithms , 1991, Comput. Aided Geom. Des..

[11]  V. G. Bolti︠a︡nskiĭ,et al.  Equivalent and equidecomposable figures , 1963 .

[12]  M. Zettler,et al.  Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion , 1998, IEEE Trans. Autom. Control..

[13]  S. Malan,et al.  B/sup 3/ algorithm for robust performances analysis in presence of mixed parametric and dynamic perturbations , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[14]  H. Hadwiger.  Vorlesungen über Inhalt, Oberfläche und Isoperimetrie , 1957 .

[15]  Rida T. Farouki,et al.  Approximation by interval Bezier curves , 1992, IEEE Computer Graphics and Applications.

[16]  Qun Lin,et al.  A family of centered forms for a polynomial , 1992 .

[17]  Christian Ullrich.  Contributions to computer arithmetic and self-validating numerical methods , 1990 .

[18]  George G. Lorentz,et al.  Deferred Bernstein polynomials , 1951 .