An n x n real matrix is said to be totally nonpositive if every minor is nonpositive. In this paper, we are interested in totally nonpositive completion problems, that is, does a partial totally nonpositive matrix have a totally nonpositive matrix completion? This problem has, in general, a negative answer. Therefore, we analyze the question: for which labeled graphs G does every partial totally nonpositive matrix, whose associated graph is G, have a totally nonpositive completion? Here we study the mentioned problem when G is a chordal graph or an undirected cycle. (c) 2005 Elsevier Inc. All rights reserved.
机构:
Zhejiang A&F Univ, Sch Sci, Hangzhou 311300, Zhejiang, Peoples R China
Hong Kong Polytech Univ, Dept Appl Math, Hong Kong, Hong Kong, Peoples R ChinaE China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
Huang, Zejun
Zhan, Xingzhi
论文数: 0引用数: 0
h-index: 0
机构:
E China Normal Univ, Dept Math, Shanghai 200241, Peoples R ChinaE China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
机构:
Departamento de Matemática, Faculdade de Ciências, Universidade de Lisboa, Rua Ernesto de Vasconcelos, 1700 Lisboa, PortugalDepartamento de Matemática, Faculdade de Ciências, Universidade de Lisboa, Rua Ernesto de Vasconcelos, 1700 Lisboa, Portugal
Silva, Fernando C.
Linear Algebra and Its Applications,
1997,
260
(1-3):
: 319
-
321