.png){kind=icon}
Return
TENSOR-TRAIN DECOMPOSITION
.png){kind=icon}
PRE
AI
DOI：10.1137/090752286.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
tensors
high-dimensional problems
SVD
TT-format
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveExistence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure.png)
COMPUTING
COMPUTINGIF2.8
PREAI
ShareSaveShareSave
ShareSaveMolecular Modeling of the Structural and Dynamical Changes in Calcium Channel TRPV5 Induced by the African-Specific A563T VariationBiochemistry
OAAI
BiochemistryIF0
OAAIShareSaveShareSave
View more