[00540] Random product homotopies for decomposing tensors
Session Time & Room : 2E (Aug.22, 17:40-19:20) @G304
Type : Contributed Talk
Abstract : The rank one decomposition of the tensor is considered. The upper bound of rank is derived under which computing the decomposition is equivalent to solving a structured polynomial system that is determined by the full rank factorization of the matricization of the tensor. Under the generic uniqueness conditions, the solutions of the system are isolated and can be efficiently achieved by random product homotopies.
