The totally positive completion problem

DOI10.1016/J.LAA.2004.03.015MaRDI QIDQ703637zbMATH OpenOpenAlexFDO

Authors Cristina Jordán, Juan Ramón Torregrosa Sánchez

Publication date 11 January 2005

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

Full work available at URL https://doi.org/10.1016/j.laa.2004.03.015

zbMATH Keywords

Completion problemPartial matrixTotally positive matrixUndirected graphs

Mathematics Subject Classification ID

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 over \(\mathbb{R}\) is a square matrix in which some entries are specified while the remaining ones are free to be chosen from \(\mathbb{R}\), with the additional property that all diagonal entries are prescribed. A completion of a partial matrix is the matrix resulting from a particular choice for the unspecified entries. A matrix completion problem asks the question: does a partial matrix with a certain property have a completion with the same property? Here the authors address the following property: a real square matrix is totally positive if every minor is nonnegative, and a partial matrix is totally positive if every completely specified submatrix is totally positive. As the answer in this case is generally negative, the authors analyze the question: for which labelled graphs \(G\) does every \(n\times n\) totally positive partial matrix whose associated graph (\(n\) vertices and edges corresponding to the specified off-diagonal elements) is \(G\), have a totally positive completion? The authors consider partial matrices whose \((i,j)\)-entry is specified if and only if its \((j,i)\)-entry is, which thus have undirected \(G\). When \(G\) is a path or a cycle, they give necessary and sufficient conditions for a positive answer.

Recommendations

• Paths and Cycles in the Totally Positive Completion Problem
• scientific article; zbMATH DE number 1182570
• Totally nonpositive completions on partial matrices
• The real positive definite completion problem for a simple cycle
• The totally non-positive matrix completion problem

Cites work

• Classes of Matrices with Distinct, Real Characteristic Values
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 1182570 (Why is no real title available?)
• scientific article; zbMATH DE number 3348831 (Why is no real title available?)
• Path product matrices
• Totally positive matrices

Cited in

(24)

• The completable digraphs for the totally nonnegative completion problem
• The real positive definite completion problem for a simple cycle
• Completely positive completion of partial matrices whose entries are completely bounded maps
• Line insertions in totally positive matrices
• Matrices totally positive relative to a tree. II.
• Complete solution to the \(TP_{2}\) completion problem
• Partial P-matrices of associated graph
• Invariance of total positivity of a matrix under entry-wise perturbation and completion problems
• Arrangements of equal minors in the positive Grassmannian
• Totally positive completions for monotonically labeled block clique graphs
• Adjacent edge conditions for the totally nonnegative completion problem
• Double-path in the totally nonnegative completion problem
• Totally positive shapes and \(TP_{k}\)-completable patterns
• On the Relationship Between Graphs and Totally Positive Matrices
• scientific article; zbMATH DE number 1182570 (Why is no real title available?)
• The real positive definite completion problem: cycle completability
• The totally non-positive matrix completion problem
• Paths and Cycles in the Totally Positive Completion Problem
• Graph theoretic methods for matrix completion problems
• The real positive semidefinite completion problem for series-parallel graphs
• Totally nonpositive completions on partial matrices
• The totally positive completion problem: the 3-by-n case
• The copositive completion problem: unspecified diagonal entries
• Subdirect sums of \(P(P_0)\)-matrices and totally nonnegative matrices

This page was built for publication: The totally positive completion problem

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