Effective Nondeterministic Positive Definiteness Test for Unidiagonal Integral Matrices

For standard algorithms verifying positive definiteness of a matrix A ∈ Mn(R) based on Sylvester's criterion, the computationally pessimistic case is this when A is positive definite. We present an algorithm realizing the same task for A ∈ M
_n
(Z), for which the case when A is positive definite is the optimistic one. The algorithm relies on performing certain edge transformations, called inflations, on the signed graph (bigraph) Δ = Δ(A) associated with A. We provide few variants of the algorithm, including Las Vegas type randomized ones (with precisely described maximal number of steps). The algorithms work very well in practice, in many cases with a better speed than the standard tests. On the other hand, our results provide an interesting example of an application of symbolic computing methods originally developed for different purposes, with a big potential for further generalizations in matrix problems.