2000 character limit reached
On the Uniqueness of the Canonical Polyadic Decomposition of third-order tensors --- Part II: Uniqueness of the overall decomposition (1301.4603v1)
Published 19 Jan 2013 in math.SP
Abstract: Canonical Polyadic (also known as Candecomp/Parafac) Decomposition (CPD) of a higher-order tensor is decomposition in a minimal number of rank-1 tensors. In Part I, we gave an overview of existing results concerning uniqueness and presented new, relaxed, conditions that guarantee uniqueness of one factor matrix. In Part II we use these results for establishing overall CPD uniqueness in cases where none of the factor matrices has full column rank. We obtain uniqueness conditions involving Khatri-Rao products of compound matrices and Kruskal-type conditions.
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.