Matrix completion problems for pairs of related classes of matrices. (Q1414126)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Matrix completion problems for pairs of related classes of matrices. |
scientific article |
Statements
Matrix completion problems for pairs of related classes of matrices. (English)
0 references
19 November 2003
0 references
Square matrices of order \(n\) with real coefficients are under consideration. A partial matrix is a matrix in which some entries may be not specified. A completion of a partial matrix is a matrix obtained by choosing values for the unspecified entries. A pattern of a matrix is a certain list of positions of its entries, i.e., a subset of the set \(\{(i,j)\mid 1\leq i,j\leq n \}\). A partial matrix specifies the pattern if its specified entries are exactly those listed in the pattern. Let \(X\) be a certain class of matrices. It is said that a pattern has an \(X\)-completion if every partial \(X\)-matrix specifying the pattern can be completed to a matrix in \(X\). Let \(X\) and \(X_0\) be classes of matrices. They are said to be \(\Pi/\Pi_0\) classes if (1) Any partial \(X\)-matrix is a partial \(X_0\)-matrix; (2) For any matrix \(A\in X_0\) and \(\varepsilon>0\) it holds that \((A+ \varepsilon I) \in X\); (3) For any partial \(X\)-matrix \(A\) there exists \(\delta>0\) such that \(A-\delta \widetilde I\) is a partial \(X\)-matrix, where \(\widetilde I\) is the partial identity matrix specifying the same pattern as \(A\). If \(X\) and \(X_0\) is a pair of \(\Pi/\Pi_0\) classes then it is proved that any pattern that has an \(X_0\) completion must also have an \(X\)-completion. Some examples of patterns that have \(X\)-completion but fail to have \(X_0\)-completion are given. The classes of matrices with any principal minor positive (non-negative, non-negative and all diagonal elements are positive) are considered. The property to be \(\Pi/\Pi_0\) classes for them and several subclasses are considered. In addition the class of inverse \(M\)-matrices and its topological closure are investigated. It is shown that the condition (3) is not satisfied for them, however the conclusion is true. The matrix completion problem is solved for the topological closure of the class of inverse \(M\)-matrices in the case of patterns containing all diagonal positions.
0 references
completion problems
0 references
matrix completion
0 references
pattern
0 references
graph
0 references
digraph
0 references
P-matrix
0 references
inverse M-matrix
0 references
partial matrix
0 references