THE COMPUTATION OF LOW MULTILINEAR RANK APPROXIMATIONS OF TENSORS VIA POWER SCHEME AND RANDOM PROJECTION

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

19 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)605-636
Journal / PublicationSIAM Journal on Matrix Analysis and Applications
Volume41
Issue number2
Online published29 Apr 2020
Publication statusPublished - 2020

Abstract

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.

Research Area(s)

  • Low multilinear rank approximation, Power scheme, Random projection, Random sub-Gaussian matrices, Randomized algorithms, Singular value decomposition, Singular values