CONNECTIONS BETWEEN THE REAL POSITIVE SEMIDEFINITE AND DISTANCE MATRIX COMPLETION PROBLEMS

被引:0
|
作者
JOHNSON, CR [1 ]
TARAZAGA, P [1 ]
机构
[1] UNIV PUERTO RICO,DEPT MATH,MAYAGUEZ,PR 00681
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Though the real symmetric positive semidefinite (PSD) matrices and the Euclidean distance matrices are closely related, exact relationships between the corresponding completion problems are not apparent. We establish strong partial relationships of two types. This permits the transfer of some insights from one problem to the other and allows computational tools for the PSD problem to be used for the distance problem.
引用
收藏
页码:375 / 391
页数:17
相关论文
共 50 条