Totally nonpositive completions on partial matrices (Q819143)

A partial matrix over \(\mathbb{R}\) is an \(n \times n\) array in which some entries are specified and remaining entries are free to be chosen from \(\mathbb{R}\). A completion of a partial matrix is a resulting matrix when a particular choice for the unspecified entries is realized. In the present paper, the completion problem is analyzed for totally nonpositive matrices, i.e., for matrices with every minor nonpositive. In general, the completion problem has no solution. It is shown that a solution exists for some special cases of totally nonpositive matrices with labeled graphs. The 1-chordal graphs guarantee the existence of the desired totally nonpositive matrix completion. Also, a necessary and sufficient condition is obtained for a totally nonpositive completion of a partial totally nonpositive matrix whose graph is a monotonically labeled cycle.