Intervals of Special Sign Regular Matrices
| dc.contributor.author | Adm, Mohammad | |
| dc.contributor.author | Garloff, Juergen | |
| dc.date.accessioned | 2017-02-01T07:22:21Z | |
| dc.date.accessioned | 2022-05-22T08:27:47Z | |
| dc.date.available | 2017-02-01T07:22:21Z | |
| dc.date.available | 2022-05-22T08:27:47Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | 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 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. | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/7834 | |
| dc.language.iso | en | en_US |
| dc.publisher | Linear and Multilinear Algebra | en_US |
| dc.subject | sign regular matrix; totally nonnegative matrix, totally nonpositive matrix, Cauchon algorithm, checkerboard ordering, matrix interval | en_US |
| dc.title | Intervals of Special Sign Regular Matrices | en_US |