Randomized algorithms for the low multilinear rank approximations of tensors

In this paper, we focus on developing randomized algorithms for the computation of low multilinear rank approximations of tensors based on the random projection and the singular value decomposition. Following the theory of the singular values of sub-Gaussian matrices, we make a probabilistic analysis for the error bounds for the randomized algorithm. We demonstrate the effectiveness of proposed algorithms via several numerical examples. (C) 2021 Elsevier B.V. All rights reserved.

Automated summary

This paper focuses on developing randomized algorithms for computing low multilinear rank approximations of tensors using random projection and singular value decomposition. The probabilistic analysis of error bounds for the randomized algorithm is based on the theory of singular values of sub-Gaussian matrices. The effectiveness of the proposed algorithms is demonstrated through several numerical examples.