Refine
Document Type
- Conference Proceeding (9)
- Article (8)
- Part of a Book (1)
- Doctoral Thesis (1)
- Other Publications (1)
Keywords
- Bernstein coefficient (4)
- Bernstein coefficients (1)
- Bernstein polynomial (6)
- Bernstein polynomials (1)
- Checkerboard ordering (1)
- Complex interval (3)
- Complex polynomial (3)
- Convex optimization (1)
- Enclosure of the range (2)
- Entry-wise perturbation (1)
- Hankel matrix (1)
- Hurwitz matrix (1)
- Interval matrix (1)
- Interval polynomial (1)
- Matrix interval (1)
- Multivariate complex polynomial (1)
- Multivariate complex rational function (1)
- Multivariate polynomial (2)
- Multivariate rational function (2)
- Polynomial evaluation (1)
- R-function (1)
- Range enclosure (5)
- Sign regular matrix (1)
- Simplicial Bernstein form (1)
- Simplicial Bernstein representation (1)
- Simplicial subdivision (1)
- Subdivision (2)
- Tensorial Bernstein form (2)
- Totally nonnegative matrix (2)
- Totally positive 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)
Institute
In this paper, multivariate polynomials in the Bernstein basis over a box (tensorial Bernstein representation) are considered. A new matrix method for the computation of the polynomial coefficients with respect to the Bernstein basis, the so-called Bernstein coefficients, is presented and compared with existing methods. Also matrix methods for the calculation of the Bernstein coefficients over subboxes generated by subdivision of the original box are proposed. All the methods solely use matrix operations such as multiplication, transposition and reshaping; some of them rely on the bidiagonal factorization of the lower triangular Pascal matrix or the factorization of this matrix by a Toeplitz matrix. In the case that the coefficients of the polynomial are due to uncertainties and can be represented in the form of intervals it is shown that the developed methods can be extended to compute the set of the Bernstein coefficients of all members of the polynomial family.
The expansion of a given multivariate polynomial into Bernstein polynomials is considered. Matrix methods for the calculation of the Bernstein expansion of the product of two polynomials and of the Bernstein expansion of a polynomial from the expansion of one of its partial derivatives are provided which allow also a symbolic computation.
Matrix methods for the computation of bounds for the range of a complex polynomial and its modulus over a rectangular region in the complex plane are presented. The approach relies on the expansion of the given polynomial into Bernstein polynomials. The results are extended to multivariate complex polynomials and rational functions.