Abstract
Totally nonnegative matrices, i.e., matrices having all minors nonnegative, are con- sidered. A condensed form of the Cauchon algorithm which has been proposed for finding a param- eterization of the set of these matrices with a fixed pattern of vanishing minors is derived. The close connection of this variant to Neville elimination and bidiagonalization is shown and new determi- nantal tests for total nonnegativity are developed which require much fewer minors to be checked than for the tests known so far. New characterizations of some subclasses of the totally nonnegative matrices as well as shorter proofs for some classes of matrices for being (nonsingular and) totally nonnegative are derived.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
