Article ID Journal Published Year Pages File Type
8897694 Linear Algebra and its Applications 2018 27 Pages PDF
Abstract
The Candecomp/Parafac decomposition (CPD) of the tensor whose maximal dimension is greater than its rank is considered. We derive the upper bound of rank under which computing the CPD 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 CPD solutions of the system are isolated so that these solutions can be achieved by homotopy method.
Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Authors
, ,