The totally non-positive matrix completion problem

MaRDI QIDQ5440497zbMATH OpenFDO

Authors Jun-Piang Liang, Ming He

Publication date 5 February 2008

zbMATH Keywords

monotonically labeled graphpartial matrixtotally non-positive matrix

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)

Recommendations

• Totally nonpositive completions on partial matrices
• Conditions for a totally positive completion in the case of a symmetrically placed cycle
• The totally positive completion problem
• scientific article; zbMATH DE number 1182570
• Double-path in the totally nonnegative completion problem

Cited in

(10)

• The completable digraphs for the totally nonnegative completion problem
• The positive Q-matrix completion problem
• scientific article; zbMATH DE number 5002128 (Why is no real title available?)
• Totally positive completions for monotonically labeled block clique graphs
• The nonsingular matrix completion problem
• Adjacent edge conditions for the totally nonnegative completion problem
• scientific article; zbMATH DE number 1182570 (Why is no real title available?)
• scientific article; zbMATH DE number 1413869 (Why is no real title available?)
• The totally positive completion problem
• Totally nonpositive completions on partial matrices

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

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