Refine
Document Type
- Conference Proceeding (24)
- Article (21)
- Part of a Book (1)
- Other Publications (1)
Keywords
- (Strict) sign-regularity (1)
- Bernstein coefficient (4)
- Bernstein coefficients (1)
- Bernstein function (1)
- Bernstein polynomial (7)
- Bernstein polynomials (1)
- Cauchon algorithm (6)
- Cauchon diagram (1)
- Cauchon matrix (1)
- Checkerboard ordering (4)
- Checkerboard partial order (1)
- Checkerboard partial ordering (1)
- Complex interval (3)
- Complex polynomial (3)
- Compound matrices (1)
- Conditionally negative semidefinite matrix (1)
- Conditionally positive semidefinite matrix (1)
- Cones of rank k (1)
- Convex optimization (1)
- Cooperative dynamical system (1)
- Cyclic sign variation (1)
- Descending rank conditions (1)
- Enclosure of the range (2)
- Entrainment (1)
- Entry-wise perturbation (2)
- Exponent of primitivity (1)
- Extended Perron complement (1)
- Exterior products (1)
- Hadamard inverse (1)
- Hadamard power (1)
- Hankel matrix (1)
- Hurwitz matrix (3)
- Infinitely divisible matrix (2)
- Interval matrix (2)
- Interval polynomial (1)
- Interval property (3)
- Inverse M-matrix (1)
- K-subdirect sum (1)
- Linear independence (1)
- Matrix interval (5)
- Multivariate complex polynomial (1)
- Multivariate complex rational function (1)
- Multivariate polynomial (2)
- Multivariate rational function (2)
- Oscillatory matrix (1)
- Perron complement (1)
- Polynomial evaluation (1)
- Primitive matrix (1)
- Quasi-stable polynomial (2)
- R-function (2)
- Range bounding (1)
- Range enclosure (5)
- Rank (2)
- Rational function (1)
- Schur complement (1)
- Sign regular matrix (3)
- Sign variation (1)
- Sign-regular matrices (1)
- Sign-regular matrix (1)
- Simplicial Bernstein form (1)
- Simplicial Bernstein representation (1)
- Simplicial subdivision (1)
- Stability analysis (2)
- Stable polynomial (2)
- Subdivision (2)
- Tensorial Bernstein form (2)
- Totally nonnegative matrix (10)
- Totally nonpositve matrix (1)
- Totally positive differential system (1)
- Totally positive matrix (3)
- 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.
Let A = [a_ij] be a real symmetric matrix. If f:(0,oo)-->[0,oo) is a Bernstein function, a sufficient condition for the matrix [f(a_ij)] to have only one positive eigenvalue is presented. By using this result, new results for a symmetric matrix with exactly one positive eigenvalue, e.g., properties of its Hadamard powers, are derived.