期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH 被引量:1
1
作者 何明 吴国宝 《Numerical Mathematics A Journal of Chinese Universities(English Series)》 SCIE 2005年第1期67-78,共12页
We present a sufficient and necessary condition for a so-called Cnk pattern to have positive semidefnite (PSD) completion. Since the graph of the Cnk pattern is composed by some simple cycles, our results extend those... We present a sufficient and necessary condition for a so-called Cnk pattern to have positive semidefnite (PSD) completion. Since the graph of the Cnk pattern is composed by some simple cycles, our results extend those given in [1] for a simple cycle.We also derive some results for a partial Toeplitz PSD matrix specifying the Cnk pattern to have PSD completion and Toeplitz PSD completion. 展开更多
关键词 循环图表 矩阵 Cn^K模式 计算方法
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部