Answers are grounded in this paper and cite their sources.
This paper is devoted to the computation of low multilinear rank approximations of tensors. Combining the stretegy of power scheme, random projection, and singular value decomposition, we derive a three-stage randomized algorithm for the low multilinear rank approximation. Based on the singular values of sub-Gaussian matrices, we derive the error bound of the proposed algorithm with high probability. We illustrate the proposed algorithms via several numerical examples.
No takes yet. Share an insight, caveat, or question.
Che et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: