Sciweavers

Share
SAC
2010
ACM

Polytope-based computation of polynomial ranges

9 years 5 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensorial Bernstein basis, which is exponential size in the number n of variables. In this paper, we consider methods to compute tight bounds for polynomials in n variables by solving two linear programming problems over a polytope. We formulate several polytopes based on the tensorial Bernstein basis, and we formulate a polytope for the quadratic patch Qn := (x1,...,xn,x2 1,..., x2 n,x1x2,...,xn−1xn) by projections. This Bernstein polytope has Θ(n2 ) hyperplanes. We give the number of vertices, the number of hyperplanes, and the volume of each polytope for n = 1,2,3,4, and we compare the range widths computed with all of them for random n-variate polynomials with n ≤ 10. The Bernstein polytope of polynomial size gives only marginally worse range bounds compared to the range bounds obtained with the tensorial ...
Christoph Fünfzig, Dominique Michelucci, Sebt
Added 17 May 2010
Updated 17 May 2010
Type Conference
Year 2010
Where SAC
Authors Christoph Fünfzig, Dominique Michelucci, Sebti Foufou
Comments (0)
books