Nein
Refine
Year of publication
Document Type
- Conference Proceeding (463)
- Article (220)
- Part of a Book (122)
- Other Publications (121)
- Book (76)
- Report (73)
- Doctoral Thesis (31)
- Master's Thesis (7)
- Patent (3)
- Bachelor Thesis (2)
Language
- German (581)
- English (538)
- Multiple languages (5)
Keywords
- (Strict) sign-regularity (1)
- 360-degree coverage (1)
- 3D Extended Object Tracking (EOT) (1)
- 3D Skelett Wickeltechnik (1)
- 3D ship detection (1)
- AAL (3)
- ADAM (1)
- Aboriginal people (1)
- Abrasive grain material (1)
- Abtragsprinzip (1)
Institute
- Fakultät Architektur und Gestaltung (26)
- Fakultät Bauingenieurwesen (29)
- Fakultät Elektrotechnik und Informationstechnik (15)
- Fakultät Informatik (54)
- Fakultät Maschinenbau (36)
- Fakultät Wirtschafts-, Kultur- und Rechtswissenschaften (54)
- Institut für Angewandte Forschung - IAF (45)
- Institut für Naturwissenschaften und Mathematik - INM (3)
- Institut für Optische Systeme - IOS (21)
- Institut für Strategische Innovation und Technologiemanagement - IST (48)
Vortrag auf dem Doktorandenkolloquium des Kooperativen Promotionskollegs der HTWG, 09.07.2015
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.
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.