Completions of P-matrix patterns

DOI10.1016/S0024-3795(00)00167-1MaRDI QIDQ5926393zbMATH OpenWikidataFDO

Authors Luz Maria DeAlba, Leslie Hogben

Publication date 2 January 2002

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0024-3795(00)00167-1

zbMATH Keywords

digraphHamiltonianmatrix completionpartial \(P\)-matrix

Mathematics Subject Classification ID

Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48)

Review text

A partially specified matrix is said to be a partial \(P\)-matrix if every fully specified principal submatrix is a \(P\)-matrix (i.e. a matrix such that all the determinants of its principal submatrices are positive. A pattern (a list of positions in the matrix) has a \(P\)-completion if every partial \(P\)-matrix specified by the pattern can be completed to a \(P\)-matrix.NEWLINENEWLINENEWLINEThe \(P\)-matrix completion problem was studied for the first time by \textit{C. R. Johnson} and \textit{B. K. Kroschel} [Electron. J. Linear Algebra 1, 59-63 (1996; Zbl 0889.15007)]. The present paper extends this work by providing a larger class of patterns having \(P\)-completion, including the \(4\times 4\) patterns with 8 or fewer off-diagonal positions. Also, an example from the first paper is extended to a family of patterns which do not have \(P\)-completion.NEWLINENEWLINENEWLINEThese results are applied to classify 207 of 218 patterns for \(4\times 4\) matrices as having \(P\)-completion or not having \(P\)-completion.

Recommendations

• On completion problems for various classes of \(P\)-matrices
• The P₀-matrix completion problem
• Partial P-matrices of associated graph
• The combinatorially symmetric P-matrix completion problem
• The (weakly) sign symmetric P-matrix completion problems

Cites work

• \(P\)-matrix completions under weak symmetry assumptions
• Completions of \(M\)-matrix patterns
• Completions of inverse M-matrix patterns
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1467357 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• Matrix Analysis
• Parallel concepts in graph theory
• Positive definite completions of partial Hermitian matrices
• The combinatorially symmetric P-matrix completion problem
• The completion problem for M-matrices and inverse M-matrices

Cited in

(13)

• Completions of \(M\)-matrix patterns
• Completions of partial \(P\)-matrices with acyclic or non-acyclic associated graph
• Matrix completion problems for pairs of related classes of matrices.
• Inverse \(M\)-matrix completions of patterns omitting some diagonal positions
• Matrix completions for linear matrix equations
• On the maximum rank of completions of entry pattern matrices
• The P₀-matrix completion problem
• scientific article; zbMATH DE number 2067015 (Why is no real title available?)
• The \(Q_0\)-matrix completion problem
• Completion of TP and TN border patterns
• TP_k completions of partial matrices with one unspecified entry
• Graph theoretic methods for matrix completion problems
• On completion problems for various classes of \(P\)-matrices

This page was built for publication: Completions of P-matrix patterns

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