论文标题
排名一个张量完成问题
Rank one tensor completion problem
论文作者
论文摘要
在本文中，我们考虑了排名第一的张量完成问题。我们解决了排名第一解决方案的存在和独特性的问题。特别是我们表明，可以在多项式时间内验证实数领域的全局唯一性。我们举例说明，在真实数字和复杂数字领域的全球唯一性问题之间存在一个本质区别。最后，我们简要讨论了噪声观察的排名第一近似问题。
In this paper, we consider the rank-one tensor completion problem. We address the question of existence and uniqueness of the rank-one solution. In particular we show that the global uniqueness over the field of real numbers can be verified in a polynomial time. We give examples showing that there is an essential difference between the question of global uniqueness over the fields of real and complex numbers. Finally we briefly discuss the rank-one approximation problem for noisy observations.
