Refine
Document Type
- Article (12)
- Conference Proceeding (12)
- Part of a Book (1)
- Doctoral Thesis (1)
- Other Publications (1)
Keywords
- Bernstein polynomial (1)
- Cauchon algorithm (7)
- Cauchon diagram (1)
- Cauchon matrix (1)
- Checkerboard ordering (4)
- Checkerboard partial order (1)
- Checkerboard partial ordering (1)
- Conditionally positive semidefinite matrix (1)
- Descending rank conditions (1)
- Entry-wise perturbation (2)
- Extended Perron complement (1)
- Hankel matrix (1)
- Hurwitz matrix (3)
- Infinitely divisible matrix (1)
- Interval matrix (2)
- Interval property (3)
- Inverse M-matrix (1)
- K-subdirect sum (1)
- Linear independence (1)
- Matrix interval (5)
- Multivariate rational function (1)
- Perron complement (1)
- Quasi-stable polynomial (2)
- R-function (2)
- Range enclosure (1)
- Rank (2)
- Schur complement (1)
- Sign regular matrix (4)
- Stable polynomial (2)
- Totally nonnegative matrix (11)
- Totally nonpositive matrix (1)
- Totally nonpositve matrix (1)
- Totally positive matrix (2)
- Vertex matrix (1)
- entry-wise perturbation (1)
- matrix interval (1)
- vertex matrix (1)
Institute
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.
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.
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.