Refine
Document Type
- Conference Proceeding (3)
- Article (2)
Language
- English (5)
Keywords
- Cauchon algorithm (4)
- Cauchon diagram (1)
- Cauchon matrix (1)
- Checkerboard partial order (1)
- Checkerboard partial ordering (1)
- Descending rank conditions (1)
- Linear independence (1)
- Matrix interval (2)
- Rank (2)
- Totally nonnegative matrix (2)
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.