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
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.
Totally nonnegative matrices, i.e., matrices having all their minors nonnegative, and matrix intervals with respect to the checkerboard partial order are considered. It is proven that if the two bound matrices of such a matrix interval are totally nonnegative and satisfy certain conditions, then all matrices from this interval are also totally nonnegative and satisfy the same conditions.
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 (Formula presented.)-by-(Formula presented.) sign regular matrices, i.e. of matrices with the property that all their minors of fixed order (Formula presented.) have one specified sign or are allowed also to vanish, (Formula presented.). If the sign is nonpositive for all (Formula presented.), 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 ordering are considered. This order is obtained from the usual entry-wise ordering on the set of the (Formula presented.)-by-(Formula presented.) 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.
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.