The completion problems and algorithms of two special partial inverse M-matrices

Inverse M-matrices have wide applications. In the paper, we discuss the completion problems and algorithms for two special partial inverse M-matrices: the tridiagonal partial inverse M-matrix and the partial matrix whose graph is acyclic without specified paths. By using the diagraph theory and the properties of inverse M-matrices, we give its completion theorems and the corresponding completion algorithms.