Double-path in the totally nonnegative completion problem

MaRDI QIDQ3629173zbMATH OpenFDO

Authors Ramadán el-Ghamry, Cristina Jordán, Juan Ramón Torregrosa Sánchez

Publication date 26 May 2009

Full work available at URL http://www.m-hikari.com/imf-password2008/33-36-2008/index.html

zbMATH Keywords

completion problemdirected graphdouble-pathpartial matrixtotally nonnegative 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

• scientific article; zbMATH DE number 1182570
• Paths and Cycles in the Totally Positive Completion Problem
• Totally nonpositive completions on partial matrices
• The totally positive completion problem
• The doubly negative matrix completion problem

Cited in

(2)

• The totally non-positive matrix completion problem
• Paths and Cycles in the Totally Positive Completion Problem

This page was built for publication: Double-path in the totally nonnegative completion problem

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