A polynomial-time test for M-matrices

A polynomial time spectral decomposition test for certain classes of inverse M-matrices

The primary result in this paper is a set of O(n) time algorithms to determine whether a speci ed real, symmetric matrix is a member of any of several closely related classes: the MMA-matrices; the inverse MMA-matrices; the strictly positive, positive de nite matrices whose eigenvectors form a Soules basis; and the strictly ultrametric matrices. When the class membership question is answered in...

Two modified Jacobi methods for M-matrices

Towards a deterministi polynomial-time Primality Test

Factorization of M-D Polynomial Matrices for Design of M-D Multirate Systems

The problem of the design of effective 2-D and 3-D multirate systems with prescribed properties is considered using tools from commutative algebra. Results for factoring 2-channel polyphase matrices are presented. After such a factorization, the number of computations may be reduced. For a 3-channel multirate system, an algorithmic version of Suslin’s stability theorem may be useful for factori...

A polynomial recognition algorithm for balanced matrices

A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per row and column in which the sum of all entries is 2 modulo 4. Conforti, Cornuéjols and Rao [9], and Conforti, Cornuéjols, Kapoor and Vušković [6], provided a polynomial algorithm to test balancedness of a matrix. In this paper we present a simpler polynomial algorithm, based on techniques introduce...