期刊
SIAM JOURNAL ON SCIENTIFIC COMPUTING
卷 33, 期 5, 页码 2295-2317出版社
SIAM PUBLICATIONS
DOI: 10.1137/090752286
关键词
tensors; high-dimensional problems; SVD; TT-format
资金
- RFBR [09-01-00565]
- RFBR/DFG [09-01-91332]
- Russian Government [Pi940, Pi1178, Pi1112]
- Russian President [MK-140.2011.1]
- Priority Research Program [OMN-3]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据