The average number of critical rank-one approximations to a tensor
The average number of critical rank-one approximations to a tensor
复制标题
张量的临界一级逼近的平均数量
DOI：
10.1080/03081087.2016.1164660
复制
发表时间：
2014
影响因子：
1.1
通讯作者：
Emil Horobet
中科院分区：
文献类型：
--
作者：
J. Draisma;Emil Horobet
由低级别多向张量近似的许多潜在应用激发，我们着手计算一号张量的距离函数的关键点到一般张量的关键点v。由于此计数取决于v，我们平均要超过v从高斯分布中绘制，并找到将该平均值与随机矩阵理论中的问题联系起来的公式。
Motivated by the many potential applications of low-rank multi-way tensor approximations, we set out to count the rank-one tensors that are critical points of the distance function to a general tensor v. As this count depends on v, we average over v drawn from a Gaussian distribution, and find a formula that relates this average to problems in random matrix theory.