Paths and Cycles in the Totally Positive Completion Problem

DOI10.1007/978-3-540-44928-7_30MaRDI QIDQ5692156zbMATH OpenOpenAlexFDO

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

Publication date 27 September 2005

Published in Positive Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-44928-7_30

zbMATH Keywords

cyclematrix completionpartial matrixpathtotally positive matrix

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48)

Recommendations

• The totally positive completion problem
• The real positive definite completion problem for a simple cycle
• scientific article; zbMATH DE number 1182570
• Totally nonpositive completions on partial matrices
• Double-path in the totally nonnegative completion problem

Cited in

(10)

• The cycle completable graphs for the completely positive and doubly nonnegative completion problems
• Conditions for a totally positive completion in the case of a symmetrically placed cycle
• Totally positive completions for monotonically labeled block clique graphs
• Double-path in the totally nonnegative completion problem
• Totally positive shapes and \(TP_{k}\)-completable patterns
• The real positive definite completion problem: cycle completability
• scientific article; zbMATH DE number 2202148 (Why is no real title available?)
• The totally positive completion problem
• The totally positive completion problem: the 3-by-n case
• TP perturbation of TN matrices and totally positive directions

This page was built for publication: Paths and Cycles in the Totally Positive Completion Problem

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