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) Positive matrices and their generalizations; cones of matrices (15B48) Inverse problems in linear algebra (15A29)

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

• 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?)
• Classes of Matrices with Distinct, Real Characteristic Values
• Path product matrices
• Totally positive matrices

Cited in

(22)

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

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)