arXiv Analytics

Sign in

arXiv:2309.02877 [math.NA]AbstractReferencesReviewsResources

A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format

Alberto Bucci, Leonardo Robol

Published 2023-09-06Version 1

The Nystr\"om method offers an effective way to obtain low-rank approximation of SPD matrices, and has been recently extended and analyzed to nonsymmetric matrices (leading to the generalized Nystr\"om method). It is a randomized, single-pass, streamable, cost-effective, and accurate alternative to the randomized SVD, and it facilitates the computation of several matrix low-rank factorizations. In this paper, we take these advancements a step further by introducing a higher-order variant of Nystr\"om's methodology tailored to approximating low-rank tensors in the Tucker format: the multilinear Nystr\"om technique. We show that, by introducing appropriate small modifications in the formulation of the higher-order method, strong stability properties can be obtained. This algorithm retains the key attributes of the generalized Nystr\"om method, positioning it as a viable substitute for the randomized higher-order SVD algorithm.

Related articles: Most relevant | Search more
arXiv:2212.13389 [math.NA] (Published 2022-12-27)
CP decomposition and low-rank approximation of antisymmetric tensors
arXiv:1410.6089 [math.NA] (Published 2014-10-22)
Low-rank approximation of tensors
arXiv:2408.05595 [math.NA] (Published 2024-08-10)
Low-rank approximation of parameter-dependent matrices via CUR decomposition