### Refine

#### Document Type

- Conference Proceeding (8)
- Article (6)
- Doctoral Thesis (1)
- Other Publications (1)

#### Keywords

- Bernstein coefficient (3)
- Bernstein coefficients (1)
- Bernstein polynomial (3)
- Bernstein polynomials (1)
- Checkerboard ordering (1)
- Complex interval (2)
- Complex polynomial (2)
- Convex optimization (1)
- Enclosure of the range (1)
- Entry-wise perturbation (1)
- Interval matrix (1)
- Interval polynomial (1)
- Matrix interval (1)
- Multivariate complex polynomial (1)
- Multivariate polynomial (1)
- Multivariate rational function (1)
- Polynomial evaluation (1)
- Range enclosure (4)
- Sign regular matrix (1)
- Simplicial Bernstein form (1)
- Simplicial Bernstein representation (1)
- Simplicial subdivision (1)
- Subdivision (2)
- Tensorial Bernstein form (2)
- Totally nonnegative matrix (1)
- Vertex matrix (1)
- degree elevation (1)
- entry-wise perturbation (1)
- matrix interval (1)
- range bounds (1)
- rational function (1)
- simplex (1)
- vertex matrix (1)

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 paper considers intervals of real matrices with respect to partial orders and the problem to infer from some exposed matrices lying on the boundary of such an interval that all real matrices taken from the interval possess a certain property. In many cases such a property requires that the chosen matrices have an identically signed inverse. We also briefly survey related problems, e.g., the invariance of matrix properties under entry-wise perturbations.

In this paper, multivariate polynomials in the Bernstein basis over a simplex (simplicial Bernstein representation) are considered. Two matrix methods for the computation of the polynomial coefficients with respect to the Bernstein basis, the so-called Bernstein coefficients, are presented. Also matrix methods for the calculation of the Bernstein coefficients over subsimplices generated by subdivision of the standard simplex are proposed and compared with the use of the de Casteljau algorithm. The evaluation of a multivariate polynomial in the power and in the Bernstein basis is considered as well. All the methods solely use matrix operations such as multiplication, transposition, and reshaping; some of them rely also on the bidiagonal factorization of the lower triangular Pascal matrix or the factorization of this matrix by a Toeplitz matrix. The latter one enables the use of the Fast Fourier Transform hereby reducing the amount of arithmetic operations.

Tests for speeding up the determination of the Bernstein enclosure of the range of a multivariate polynomial and a rational function over a box and a simplex are presented. In the polynomial case, this enclosure is the interval spanned by the minimum and the maximum of the Bernstein coefficients which are the coefficients of the polynomial with respect to the tensorial or simplicial Bernstein basis. The methods exploit monotonicity properties of the Bernstein coefficients of monomials as well as a recently developed matrix method for the computation of the Bernstein coefficients of a polynomial over a box.