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 1970, B.A. Asner, Jr., proved that for a real quasi-stable polynomial, i.e., a polynomial whose zeros lie in the closed left half-plane of the complex plane, its finite Hurwitz matrix is totally nonnegative, i.e., all its minors are nonnegative, and that the converse statement is not true. In this work, we explain this phenomenon in detail, and provide necessary and sufficient conditions for a real polynomial to have a totally nonnegative finite Hurwitz matrix.
Further applications of the Cauchon algorithm to rank determination and bidiagonal factorization
(2018)
For a class of matrices connected with Cauchon diagrams, Cauchon matrices, and the Cauchon algorithm, a method for determining the rank, and for checking a set of consecutive row (or column) vectors for linear independence is presented. Cauchon diagrams are also linked to the elementary bidiagonal factorization of a matrix and to certain types of rank conditions associated with submatrices called descending rank conditions.
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.