The symmetric \(M\)-matrix and symmetric inverse \(M\)-matrix completion problems (Q697049)

A partial matrix is a matrix in which some entries are specified and others are not. The completion problem for partial matrices consists in choosing values for the unspecified entries in such a way as the completed matrix belongs to a particular class of matrices. A partial \(n \times n\) matrix specifies a pattern (i.e. a list of positions) if its known entries are exactly in the positions listed in the pattern. A partial matrix \(B\) is symmetric if whenever \(b_{ij}\) is specified then so is \(b_{ji}\) and \(b_{ji}=b_{ij}\). A pattern is symmetric if position \((i,j)\) in the pattern implies \((j,i)\) is also in the pattern. A real matrix is called an \(M\)-matrix (respectively, \(M_0\)-matrix) if all its eigenvalues have positive (nonnegative) real part and all its off diagonal entries are nonpositive. An inverse \(M\)-matrix is the inverse of an \(M\)-matrix. In the paper under review the author investigates the completion problem for these classes of matrices. Precisely she classifies the specified pattern from the point of view of the existence of the completion of symmetric inverse \(M\)-matrices or from the point of view of the existence of the completion both of \(M\)-matrices and \(M_0\)-matrices. The matter is provided with characterizations in terms of graph theory and with examples.