共 50 条
Paths and cycles in the totally positive completion problem
被引:0
|作者:
Jordán, C
[1
]
Torregrosa, JR
[1
]
机构:
[1] Univ Politecn Valencia, Dept Matemat Aplicada, E-46071 Valencia, Spain
来源:
关键词:
D O I:
暂无
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
An n x n real matrix is said to be totally positive if every minor is nonnegative. In this paper, we are interested in totally positive completion problems, that is, when a partial totally positive matrix has a totally positive matrix completion. This problem has, in general, a negative answer when the graph of the specified entries of the partial matrix is a path or a cycle. For these cases, we obtain necessary and sufficient conditions in order to obtain the desired completion.
引用
收藏
页码:217 / 224
页数:8
相关论文