Refine
Year of publication
Document Type
- Journal (19)
- Article (4)
- Conference Proceeding (3)
- Part of a Book (1)
- Other Publications (1)
- Working Paper (1)
Language
- German (22)
- English (6)
- Multiple languages (1)
Keywords
- Amphibienfahrzeug (1)
- Bernstein polynomial (1)
- Brücke (1)
- Brückenarchitekt (1)
- Brückenbau (1)
- Cantilever Construction (1)
- Cauchon algorithm (3)
- Cauchon diagram (1)
- Cauchon matrix (1)
- Checkerboard partial ordering (1)
Institute
- Institut für Angewandte Forschung - IAF (29) (remove)
IAF Jahresbericht 2000
(2001)
IAF Jahresbericht 2001
(2002)
IAF Jahresbericht 2002
(2003)
IAF Jahresbericht 2003
(2004)
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.
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.
