The P₀-matrix completion problem

DOI10.13001/1081-3810.1068MaRDI QIDQ2778502zbMATH OpenOpenAlexFDO

Authors Mandi S. Maxwell, Amy Wangsness, Ji Young Choi, Luz Maria DeAlba, Leslie Hogben

Publication date 7 March 2002

Published in ELA. The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/122344, http://www.emis.de/journals/ELA/ela-articles/9.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

\(n\)-cycle\(P\)-matrix completiondigraphpartial matrix

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48)

Review text

A partial matrix is a rectangular array in which some entries are specified while others are free to be chosen. A completion of a partial matrix is a specific choice of values for the unspecified entries. A pattern for \(n \times n\) matrices is a list of positions of the matrix.NEWLINENEWLINENEWLINEAn \(n \times n\) matrix is called a \(P_0\)-matrix (respectively, a \(P\)-matrix) if all the determinant of its principal submatrices are nonnegative (respectively, positive). A partial \(P_0\)-matrix (respectively, a partial \(P\)-matrix) is a partial matrix in which all fully specified principal submatrices are \(P_0\)-matrices (respectively, \(P\)-matrices).NEWLINENEWLINENEWLINEA partial matrix is called asymmetric if whenever \(i \neq j\) and \(a_{ij}\) is specified, then \(a_{ji}\) is not specified. A non-symmetric pattern for \(n \times n\) matrices that includes all diagonal positions can be described by means of a digraph on \(n\) vertices; namely, the directed edge \((i,j)\), \(1 \leq i,j \leq n\), is in the arc set of the digraph if and only if the ordered pair \((i,j)\) is in the pattern.NEWLINENEWLINENEWLINEThe authors prove that every asymmetric partial \(P\)-matrix (or \(P_0\)-matrix) has \(P\)-completion (or \(P_0\)-completion). Furthermore they prove that a pattern that includes all diagonal positions and whose digraph is a symmetric \(n\)-cycle has \(P_0\)-completion for \(n \geq 5\).NEWLINENEWLINENEWLINETables and examples support the results.

Recommendations

• The (weakly) sign symmetric P-matrix completion problems
• The nonnegative P₀-matrix completion problem
• Completions of P-matrix patterns
• The P₀^+-matrix completion problem
• The combinatorially symmetric P-matrix completion problem

Cited in

(20)

• Matrix completion problems for pairs of related classes of matrices.
• \(P\)-matrix completions under weak symmetry assumptions
• Inverse \(M\)-matrix completion problem with zeros in the inverse completion
• The positive Q-matrix completion problem
• Partial P-matrices of associated graph
• scientific article; zbMATH DE number 5002128 (Why is no real title available?)
• The P₀^+-matrix completion problem
• The combinatorially symmetric P-matrix completion problem
• The (weakly) sign symmetric P-matrix completion problems
• Poisson Matrix Recovery and Completion
• The General Matrix Pencil Completion Problem: A Minimal Case
• The nonnegative P₀-matrix completion problem
• scientific article; zbMATH DE number 1413869 (Why is no real title available?)
• The \(Q_0\)-matrix completion problem
• Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros
• The nonnegative Q-matrix completion problem
• Sign pattern matrices that admit \(P_{0}\)-matrices
• Completions of P-matrix patterns
• The symmetric \(M\)-matrix and symmetric inverse \(M\)-matrix completion problems
• On completion problems for various classes of \(P\)-matrices

This page was built for publication: The \(P_0\)-matrix completion problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778502)