期刊
SIAM JOURNAL ON SCIENTIFIC COMPUTING
卷 31, 期 5, 页码 3744-3759出版社
SIAM PUBLICATIONS
DOI: 10.1137/090748330
关键词
Tree-Tucker; canonical decomposition; Tucker decomposition; curse of dimensionality
资金
- RFBR [08-01-00115, 09-01-00565, 09-01-91332]
For d-dimensional tensors with possibly large d > 3, an hierarchical data structure, called the Tree-Tucker format, is presented as an alternative to the canonical decomposition. It has asymptotically the same (and often even smaller) number of representation parameters and viable stability properties. The approach involves a recursive construction described by a tree with the leafs corresponding to the Tucker decompositions of three-dimensional tensors, and is based on a sequence of SVDs for the recursively obtained unfolding matrices and on the auxiliary dimensions added to the initial spatial dimensions. It is shown how this format can be applied to the problem of multidimensional convolution. Convincing numerical examples are given.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据