Efficient Tensor Decomposition Algorithm for Overcomplete Tensors

The author presents a new, constructive uniqueness theorem for tensor decomposition that applies to order 3 tensors of format n×n×p and can prove uniqueness of decomposition for generic tensors up to rank r = 4n/3 as soon as p ≥4. This leads to the first efficient algorithm for overcomplete decomposition of generic tensors.