摘要
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.
源语言 | 英语 |
---|---|
页(从-至) | 847-873 |
页数 | 27 |
期刊 | Journal of the Operations Research Society of China |
卷 | 12 |
期 | 4 |
DOI | |
出版状态 | 已出版 - 12月 2024 |
已对外发布 | 是 |
指纹
探究 'Low Rank Tensor Decompositions and Approximations: Low Rank Tensor Decompositions and Approximations: J. Nie et al.' 的科研主题。它们共同构成独一无二的指纹。引用此
Nie, J., Wang, L., & Zheng, Z. (2024). Low Rank Tensor Decompositions and Approximations: Low Rank Tensor Decompositions and Approximations: J. Nie et al. Journal of the Operations Research Society of China, 12(4), 847-873. https://doi.org/10.1007/s40305-023-00455-7