In linear algebra, a completely-S matrix is a square matrix such that for every principal submatrix R there exists a positive vector u such that Ru > 0. [1]
In linear algebra, a completely-S matrix is a square matrix such that for every principal submatrix R there exists a positive vector u such that Ru > 0. [1]