Refine
Document Type
- Article (21) (remove)
Keywords
- (Strict) sign-regularity (1)
- Bernstein coefficient (3)
- Bernstein function (1)
- Bernstein polynomial (2)
- Cauchon algorithm (4)
- Cauchon diagram (1)
- Cauchon matrix (1)
- Checkerboard ordering (2)
- Checkerboard partial order (1)
- Complex interval (1)
- Complex polynomial (1)
- Compound matrices (1)
- Conditionally negative semidefinite matrix (1)
- Conditionally positive semidefinite matrix (1)
- Cones of rank k (1)
- Cooperative dynamical system (1)
- Descending rank conditions (1)
- Enclosure of the range (1)
- 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 (2)
- Infinitely divisible matrix (2)
- Interval polynomial (1)
- Interval property (2)
- Inverse M-matrix (1)
- K-subdirect sum (1)
- Matrix interval (3)
- Multivariate complex rational function (1)
- Multivariate polynomial (1)
- Multivariate rational function (1)
- Oscillatory matrix (1)
- Perron complement (1)
- Polynomial evaluation (1)
- Primitive matrix (1)
- Quasi-stable polynomial (1)
- R-function (2)
- Range enclosure (2)
- Rank (1)
- Schur complement (1)
- Sign regular matrix (2)
- Sign-regular matrices (1)
- Simplicial Bernstein form (1)
- Simplicial Bernstein representation (1)
- Simplicial subdivision (1)
- Stability analysis (2)
- Stable polynomial (1)
- Subdivision (1)
- Tensorial Bernstein form (2)
- Totally nonnegative matrix (7)
- Totally nonpositve matrix (1)
- Totally positive differential system (1)
- Totally positive matrix (2)
- 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.
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.
A real matrix is called totally nonnegative if all of its minors are nonnegative. In this paper the extended Perron complement of a principal submatrix in a matrix A is investigated. In extension of known results it is shown that if A is irreducible and totally nonnegative and the principal submatrix consists of some specified consecutive rows then the extended Perron complement is totally nonnegative. Also inequalities between minors of the extended Perron complement and the Schur complement are presented.
We consider classes of n-by-n sign regular matrices, i.e., of matrices with the property that all their minors of fixed order k have one specified sign or are allowed also to vanish, k = 1, ... ,n. If the sign is nonpositive for all k, such a matrix is called totally nonpositive. The application of the Cauchon algorithm to nonsingular totally nonpositive matrices is investigated and a new determinantal test for these matrices is derived. Also matrix intervals with respect to the checkerboard partial ordering are considered. This order is obtained from the usual entry-wise ordering on the set of the n-by-n matrices by reversing the inequality sign for each entry in a checkerboard fashion. For some classes of sign regular matrices it is shown that if the two bound matrices of such a matrix interval are both in the same class then all matrices lying between these two bound matrices are in the same class, too.
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 totally nonnegative (positive) matrices are considered which are matrices having all their minors nonnegative (positve); the almost totally positive matrices form a class between the totally nonnegative matrices and the totally positive ones. An efficient determinantal test based on the Cauchon algorithm for checking a given matrix for falling in one of these three classes of matrices is applied to matrices which are related to roots of polynomials and poles of rational functions, specifically the Hankel matrix associated with the Laurent series at infinity of a rational function and matrices of Hurwitz type associated with polynomials. In both cases it is concluded from properties of one or two finite sections of the infinite matrix that the infinite matrix itself has these or related properties. Then the results are applied to derive a sufficient condition for the Hurwitz stability of an interval family of polynomials. Finally, interval problems for a subclass of the rational functions, viz. R-functions, are investigated. These problems include invariance of exclusively positive poles and exclusively negative roots in the presence of variation of the coefficients of the polynomials within given intervals.
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.
A real matrix is called totally nonnegative if all of its minors are nonnegative. In this paper, the minors are determined from which the maximum allowable entry perturbation of a totally nonnegative matrix can be found, such that the perturbed matrix remains totally nonnegative. Also, the total nonnegativity of the first and second subdirect sum of two totally nonnegative matrices is considered.