Tensor-Train Decomposition
摘要：
Summary: A simple nonrecursive form of the tensor decomposition in $d$ dimensions is presented. It does not inherently suffer from the curse of dimensionality, it has asymptotically the same number of parameters as the canonical decomposition, but it is stable and its computation is based on low-rank approximation of auxiliary unfolding matrices. The new form gives a clear and convenient way to implement all basic operations efficiently. A fast rounding procedure is presented, as well as basic linear algebra operations. Examples showing the benefits of the decomposition are given, and the efficiency is demonstrated by the computation of the smallest eigenvalue of a 19-dimensional operator.
展开
DOI：
10.1137/090752286
被引量：
年份：
2011
相似文献
参考文献
引证文献
引用走势
站内活动
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用！
