Efficient Randomized Algorithms for Computing an Approximation of the Tensor Train Decomposition

For the fixed-TT-rank problem, the proposed algorithms can be several times faster than the TT-SVD, and the accuracy of the proposed algorithms and the TT-SVD are comparable for several test tensors.