### Refine

#### Document Type

- Article (1)
- Conference Proceeding (1)
- Doctoral Thesis (1)

#### Language

- English (3)

#### Has Fulltext

- no (3)

#### Keywords

- Bernstein Basis (1)
- Bernstein polynomial (2)
- Control Theory (1)
- Numerical Optimization (1)
- Range bounding (1)
- Rational function (1)
- degree elevation (1)
- range bounds (1)
- rational function (1)
- simplex (1)

A method is investigated by which tight bounds on the range of a multivariate rational function over a box can be computed. The approach relies on the expansion of the numerator and denominator polynomials in Bernstein polynomials. Convergence of the bounds to the range with respect to degree elevation of the Bernstein expansion, to the width of the box and to subdivision are proven and the inclusion isotonicity of the related enclosure function is shown.

Bernstein polynomials on a simplex V are considered. The expansion of a given polynomial p into these polynomials provides bounds for range of p over V. Bounds for the range of a rational function over V can easily be obtained from the Bernstein expansions of the numerator and denominator polynomials of this function. In this paper it is shown that these bounds converge monotonically and linearly to the range of the rational function if the degree of the Bernstein expansion is elevated. If V is subdivided then the convergence is quadratic with respect to the maximum of the diameters of the subsimplices.

This thesis considers bounding functions for multivariate polynomials and rational functions over boxes and simplices. It also considers the synthesis of polynomial Lyapunov functions for obtaining the stability of control systems. Bounding the range of functions is an important issue in many areas of mathematics and its applications like global optimization, computer aided geometric design, robust control etc.