Computation of the Bernstein Coecients on Subdivided. are computed directly from the coecients on the subdivided triangle from the

Transcription

1 Computation of the Bernstein Coecients on Subdivided riangles Ralf Hungerbuhler Fakultat fur Mathematik und Informatik, Universitat Konstanz, Postfach 5560 D 97, D{78434 Konstanz, Germany Jurgen Garlo (garloff@fh-konstanz.de) Fachbereich Informatik, Fachhochschule Konstanz, Postfach , D{78405 Konstanz, Germany Abstract. We present a procedure for computing the coecients of the expansion of a bivariate polynomial into Bernstein polynomials over subtriangles. hese triangles are generated by partitioning the standard simplex of IR. he coecients are computed directly from the coecients on the subdivided triangle from the preceding subdivision level. his allows a recursive computation of the coecients and facilitates the economical computation of bounds for the range of a bivariate polynomial over a given triangle. Keywords: Range enclosure, Bernstein polynomials, subdivision. Introduction Finding a tight enclosure for the range of a function over a compact set D IR l is a basic problem of interval computations, cf. [5],[6] and the references therein. If the function is a multivariate polynomial and D is a box, there exist several methods, for references cf. [4]. Compared to boxes, simplices allow more exibility since far more general geometries can be treated. In [4] we present a method for computing bounds for the range of a bivariate polynomial p(x; y) n ; 0 a x y with a C over a triangle. his method is based on the expansion of p into Bernstein polynomials. If p has only real coecients the minimum and the maximum of the coecients of this expansion, the so{called Bernstein coecients, provide lower and upper bounds for the range. All rounding errors appearing in the computation of the Bernstein coecients can be taken into account similarly as in [] for the univariate case. In the case Author to whom all correspondence should be directed. c 999 Kluwer Academic Publishers. Printed in the Netherlands. veroeffb.tex; /09/999; 7:37; p.

2 that p has complex coecients the convex hull of the Bernstein coecients encloses the range, for details see [4]. Without loss of generality we can assume that the given triangle is the unit triangle n(x; y) IR x; y 0 ^ x + y o since any nonempty triangle can be mapped by an ane transformation onto. he bounds are improved by subdivision. In partitioning we are led by the following useful fact []: When we subdivide a square by successively halving in both coordinate directions and calculate the Bernstein coecients on a generated subsquare then we obtain as a byproduct of the computation the Bernstein coecients on the neighbouring subsquares. his is one of the reasons why we partition into squares and triangles, cf. Figures and 3 in [4]. In this technical note we use the denitions and notations from [4] and present a procedure for computing the Bernstein coecients on the subtriangles and of the triangle t m, t ; : : :; m, m, which are subtriangles generated by subdivision; in the beginning these are the triangle and the subtriangles with vertex sets f(0, ), (, ), (0,)g and f(,0), (,0), (, )g. he Bernstein coecients are computed directly from the Bernstein coecients on the triangle t m. his allows a recursive computation of the Bernstein coecients on the subtriangles and facilitates the economical computation of the bounds for the range of the given polynomial over. In passing we note that the procedure presented in [4] for computing the Bernstein coecients on the four subsquares generated by halving [0; ] [0; ] in both coordinate directions can be generalized to the l{dimensional case. he resulting algorithm is rather technical. he procedure is therefore omitted here and the interested reader is referred to [3].. Main Result In this section we give the procedure for computing the Bernstein coecients on the subtriangles and of a triangle t m. In the following stands for or. PROCEDURE Let m and t f; : : :; m g. Start by setting (0) b ( m t ) for all (; ) I (n) ; veroeffb.tex; /09/999; 7:37; p.

3 3 then for 0; : : :; n (+) (+). ;+ + +; for (; ) I ((n)) ; (; ) I ((n)), (;) (;) (;) ; (n) ;+ + +; 0;+. ;. ; 9 > >; () ; 0; : : :; (n ) ; (). + ; 0; : : :; (n); + +;0. ; 0; : : :; (n); for nally for ;, 0; : : :; n and ; : : :; (n ) (; +) (; ) + (; ) ;+. ; 0; : : :; (n) : heorem he Bernstein coecients on the subtriangles at subdivision level can be obtained by the Procedure from the following relations with (i; j) I (n) 8>< b ij >: 8>< b ij >: (nij;j(ni)) 0 (i) 0j (i;(ni)j) j (nij;i(nj)) i (j) i0 (j;(nj)i) i : First one shows by induction on that 4 u v ;(n) (n); 4 u;v 0 u;v 0 u v if (n i) < j ; if (n i) j ; if (n i) > j ; if (n j) < i ; if (n j) i ; if (n j) > i : b +u;n(+u)(+v) (t m (3) ) ; b n(+u)(+v);+v ( m t ) veroeffb.tex; /09/999; 7:37; p.3

4 4 holds true for all (; ) I ((n)) for 0; : : :; n. hen one proves by induction on ; : : :; (n ) that the following identity is true for all ; and 0; : : :; n (; ) + (;) ;+h ; 0; : : :; (n) : h h 0 (4) We show the statements of the theorem only for the subtriangle and only in the case (n i) < j. he proof for the two remaining cases and for the subtriangle is analogous. o simplify notation, we mark the dependency from and t m of the quantities considered in the sequel by writing m + and m for short. From () and () it follows that for 0; : : :; (n ) (;) (m + ) (m + ) ;(n) (m + ) + ;(n) b +u;n(+u)v (m) u v u;v0 + b +u+;n(+u+)v (m) u v u;v0 + + b +u;n(+u)v (m) ; u v u0 v0 +;(n) (m + ). where the last but one identity follows from (3). Now we apply identity (4) to conclude from this result that j(ni) (j(ni))+ j(ni) jn nij+ u0 h0 nij v0 i(nij) nij v0 (nij;j(ni)) 0 (m + ) h0 j (n i) j (n i) h n i j + u n i j v h i n i j u0 v (nij;) h (m + ) minfu;j(ni)g h0 b h+u;n(h+u)v (m) j (n i) h veroeffb.tex; /09/999; 7:37; p.4

5 n i j + u h i(nij) i u0 b u;nuv (m) i nij v0 u n i j v b u;nuv (m) : o obtain the last but one identity we used the Vandermonde convolution formula, e.g., [7]. Now by Lemma 4. in [4] we can conclude (nij;j(ni)) 0 (m + ) b ij (m + ) : o compute the Bernstein coecients on the subtriangles 5 and by the Procedure requires 6 3 n3 + 4n n additions and the same amount of multiplications (binary shifts). Here we made use of the relations and (0) (0; ) (0) (0; ) for (; ) I (n) for ; : : :; n and 0; : : :; n : hen the cumulated operations count for the procedure for computing the Bernstein coecients on all subsquares and subtriangles lling the unit triangle at subdivision level i for all i ; : : :; m sums up to O(4 m n 3 ) additions and the same amount of multiplications (binary shifts). 3. Numerical Example It was shown in [4] that the convex hull of the Bernstein coecients on all subsquares and subtriangles generated at subdivision level m, denoted by C m, provides an enclosure for the range of p over. Obviously, a tighter enclosure for this range is given by taking the union of the convex hulls of the Bernstein coecients on each subregion at level m, i.e., where C S m rs : conv C 0 m [ S [ C S m rs r ;:::; m s ;:::; m r t ;:::; m C m t ; nb ij (S o mrs ) (n) (i; j) I S ; r ; : : :; m ; veroeffb.tex; /09/999; 7:37; p.5

6 6 and C m t n : conv b ij (t m ) (i; j) I (n) s ; : : :; m r o ; t ; : : :; m : We consider now the polynomial p(x; y) 3: + :i + (:8 + 4i)y + (:5 + i)x + (7 + 8i)xy : Figures and show C 0 m for m ; 4. Already three extreme points of C 0 are sharp, viz. b 00 S a00 p(0; 0) 3: + :i ; b 0 a00 + a 0 p(0; ) :3 + 5:i ; b 0 4 a00 + a 0 p(; 0) 5:6 + :i : y 6 0 Figure. Enclosure C 0 for the range of p over - x he edges connecting 3:+:i with the points :3+5:i and 5:6+:i are part of the range of p and are therefore sharp. Yet the rest of the boundary of C 0 provides a crude approximation of the image of the straight line connecting (0; ) with (; 0). veroeffb.tex; /09/999; 7:37; p.6

7 7 y x Figure. Enclosure C 0 4 for the range of p over he set C4 0 gives a much better approximation of the range of p. For illustration, the convex hulls of the Bernstein coecients which constitute C4 0 are displayed. he convex hulls of the Bernstein coecients on the subsquares are already identical to the respective ranges of p. Acknowledgements Support from the Ministry of Science and Research Baden{Wurttemberg and from the Ministry of Education, Science, Research, and echnology of the Federal Republic of Germany under the contract no is gratefully acknowledged. References. Fischer, H. C., \Range Computations and Applications," in \Contributions to Computer Arithmetic and Self{Validating Numerical Methods," C. Ullrich, Ed., J. C. Baltzer, Amsterdam, pp. 97{, Garlo, J., \he Bernstein Algorithm," Interval Computations, Vol., 993, pp. 54{ Hungerbuhler, R., \Bounds for the Range of a Multivariate Polynomial over riangles (in German)," diploma thesis, Faculty for Mathematics and Computer Science, University of Constance, Constance, Germany, 998. veroeffb.tex; /09/999; 7:37; p.7

8 8 4. Hungerbuhler, R. and Garlo, J., \Bounds for the Range of a Bivariate Polynomial over a riangle," Reliable Computing, Vol. 4, 998, pp. 3{3. 5. Neumaier, A., \Interval Methods for Systems of Equations," Cambridge Univ. Press, Cambridge, 990, Chapter. 6. Ratschek, H. and Rokne, J., \Computer Methods for the Range of Functions," Ellis Horwood Ltd., Chichester, Riordan, R., \Combinatorial Identities," Wiley and Sons, New York, 968, p. 8 and p.. veroeffb.tex; /09/999; 7:37; p.8