2000 character limit reached
Low Rank Tensor Decompositions and Approximations (2208.07477v1)
Published 16 Aug 2022 in math.NA and cs.NA
Abstract: There exist linear relations among tensor entries of low rank tensors. These linear relations can be expressed by multi-linear polynomials, which are called generating polynomials. We use generating polynomials to compute tensor rank decompositions and low rank tensor approximations. We prove that this gives a quasi-optimal low rank tensor approximation if the given tensor is sufficiently close to a low rank one.
- Jiawang Nie (66 papers)
- Li Wang (470 papers)
- Zequn Zheng (3 papers)