The symmetric M-matrix and symmetric inverse M-matrix completion problems
The symmetric \(M\)-matrix and symmetric inverse \(M\)-matrix completion problems
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.
- The symmetric inverse M-matrix completion problem
- The symmetric N-matrix completion problem
- The combinatorially symmetric P-matrix completion problem
- The combinatorially symmetric partial N-matrix completion
- The completion problem for M-matrices and inverse M-matrices
- The (weakly) sign symmetric P-matrix completion problems
- scientific article; zbMATH DE number 2051073
- \(P\)-matrix completions under weak symmetry assumptions
- Matrix inverse problem and its optimal approximation problem for \(R\)-symmetric matrices
- scientific article; zbMATH DE number 6810269
- Completions of \(M\)-matrix patterns
- Completions of inverse M-matrix patterns
- Graph theoretic methods for matrix completion problems
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- Inverse \(M\)-matrix completions of patterns omitting some diagonal positions
- Inverse M-matrices
- On nonnegative factorization of matrices
- On the inverse M-matrix problem for (0,1)-matrices
- The P₀-matrix completion problem
- The completely positive and doubly nonnegative completion problems
- The completion problem for M-matrices and inverse M-matrices
- The symmetric inverse M-matrix completion problem
- The symmetric inverse M-matrix completion problem
- Matrix completion problems for pairs of related classes of matrices.
- \(P\)-matrix completions under weak symmetry assumptions
- Inverse \(M\)-matrix completions of patterns omitting some diagonal positions
- Inverse \(M\)-matrix completion problem with zeros in the inverse completion
- Completions of inverse M-matrix patterns
- The completion problem for M-matrices and inverse M-matrices
- Inverse \(M\)-matrix, a new characterization
- The combinatorially symmetric P-matrix completion problem
- scientific article; zbMATH DE number 2051073 (Why is no real title available?)
- scientific article; zbMATH DE number 6810269 (Why is no real title available?)
- scientific article; zbMATH DE number 6961486 (Why is no real title available?)
- Graph theoretic methods for matrix completion problems
This page was built for publication: The symmetric \(M\)-matrix and symmetric inverse \(M\)-matrix completion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697049)
