摘要
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.
源语言 | 英语 |
---|---|
期刊 | Journal of the Operations Research Society of China |
DOI | |
出版状态 | 已接受/待刊 - 2023 |
已对外发布 | 是 |