A test for strict sign-regularity

AbstractA characterization of strict sign-regular matrices is obtained. It is given in an algorithmic form which allows the easy construction of a test to check if a matrix is strictly sign-regular. The test is based on the Neville elimination of several submatrices of A and requires less computational work than those which can be derived from other previously known characterizations of these matrices