Effective algorithms for tensor train decomposition via the UTV framework (2501.07904v1)

Abstract: The tensor train (TT) decomposition is used to compress large tensors into a more compact form by exploiting their inherent data structures. A fundamental approach for constructing the TT format is the TT-SVD, which extracts the TT-cores by the singular value decompositions (SVDs) sequentially. But in practical applications, it is often not necessary to compute full SVDs. In this article, we therefore propose a new method called the TT-UTV. It utilizes the virtues of rank-revealing UTV decomposition to compute the TT format for a large-scale tensor, hence requires less computational cost. We analyze the error bounds on the accuracy of these algorithms both in the URV and ULV cases, then recommend different sweep patterns for these two cases. We perform numerical experiments on some applications, including magnetic resonance imaging (MRI) data completion, to illustrate their good performance in practice.