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
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.
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.
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.
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.
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.
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.
In this article, the collection of classes of matrices presented in [J. Garloff, M. Adm, ad J. Titi, A survey of classes of matrices possessing the interval property and related properties, Reliab. Comput. 22:1-14, 2016] is continued. That is, given an interval of matrices with respect to a certain partial order, it is desired to know whether a special property of the entire matrix interval can be inferred from some of its element matrices lying on the vertices of the matrix interval. The interval property of some matrix classes found in the literature is presented, and the interval property of further matrix classes including the ultrametric, the conditionally positive semidefinite, and the infinitely divisible matrices is given for the first time. For the inverse M-matrices the cardinality of the required set of vertex matrices known so far is significantly reduced.
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.
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.