The combinatorially symmetric P-matrix completion problem
From MaRDI portal
Publication:4379572
DOI10.13001/1081-3810.1004zbMath0889.15007OpenAlexW765462833MaRDI QIDQ4379572
Charles R. Johnson, Brenda K. Kroschel
Publication date: 8 March 1998
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119413
Positive matrices and their generalizations; cones of matrices (15B48) Canonical forms, reductions, classification (15A21)
Related Items (18)
Matrix completions for linear matrix equations ⋮ On completion problems for various classes of \(P\)-matrices ⋮ Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem ⋮ Completions of \(M\)-matrix patterns ⋮ Unnamed Item ⋮ Completions of partial \(P\)-matrices with acyclic or non-acyclic associated graph ⋮ Matrix completion problems for pairs of related classes of matrices. ⋮ Completions of P-matrix patterns ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Graph theoretic methods for matrix completion problems ⋮ The doubly negative matrix completion problem ⋮ The positive Q-matrix completion problem ⋮ Completions of inverse \(M\)-matrix patterns ⋮ \(P\)-matrix completions under weak symmetry assumptions ⋮ Inverse \(M\)-matrix completions of patterns omitting some diagonal positions ⋮ The copositive completion problem ⋮ Sub-direct sums and positivity classes of matrices ⋮ The Q0-matrix completion problem
This page was built for publication: The combinatorially symmetric P-matrix completion problem
