2000 character limit reached
Generic uniqueness conditions for the canonical polyadic decomposition and INDSCAL (1405.6238v2)
Published 23 May 2014 in math.AG
Abstract: We find conditions that guarantee that a decomposition of a generic third-order tensor in a minimal number of rank-$1$ tensors (canonical polyadic decomposition (CPD)) is unique up to permutation of rank-$1$ tensors. Then we consider the case when the tensor and all its rank-$1$ terms have symmetric frontal slices (INDSCAL). Our results complement the existing bounds for generic uniqueness of the CPD and relax the existing bounds for INDSCAL. The derivation makes use of algebraic geometry. We stress the power of the underlying concepts for proving generic properties in mathematical engineering.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.