© 2015 Society for Industrial and Applied Mathematics. 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 a 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.23 pagesstatus: publishe
We study uniqueness of the decomposition of an nth order tensor (also called n-way array) into a sum...
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitr...
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitr...
Canonical Polyadic (also known as Candecomp/Parafac) Decomposition (CPD) of a higher-order tensor is...
Canonical polyadic decomposition (CPD) of a higher-order tensor is decomposition into a minimal numb...
Copyright © by SIAM. Coupled tensor decompositions are becoming increasingly important in signal pro...
We study the uniqueness of the decomposition of an nth order tensor (also called n-way array) into a...
We propose a new sufficient condition for verifying whether general rank-r complex tensors of arbitr...
Canonical polyadic decomposition (CPD) of a third-order tensor is decomposition in a minimal number ...
In many applications signals or data vary with respect to several parameters (such as spatial coord...
In this paper, we derive improved uniqueness conditions for a constrained version of the canonical o...
Hitchcock's rank decomposition--also known as Candecomp or Parafac--can be considered a generalizati...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We study uniqueness of the decomposition of an nth order tensor (also called n-way array) into a sum...
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitr...
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitr...
Canonical Polyadic (also known as Candecomp/Parafac) Decomposition (CPD) of a higher-order tensor is...
Canonical polyadic decomposition (CPD) of a higher-order tensor is decomposition into a minimal numb...
Copyright © by SIAM. Coupled tensor decompositions are becoming increasingly important in signal pro...
We study the uniqueness of the decomposition of an nth order tensor (also called n-way array) into a...
We propose a new sufficient condition for verifying whether general rank-r complex tensors of arbitr...
Canonical polyadic decomposition (CPD) of a third-order tensor is decomposition in a minimal number ...
In many applications signals or data vary with respect to several parameters (such as spatial coord...
In this paper, we derive improved uniqueness conditions for a constrained version of the canonical o...
Hitchcock's rank decomposition--also known as Candecomp or Parafac--can be considered a generalizati...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by me...
We study uniqueness of the decomposition of an nth order tensor (also called n-way array) into a sum...
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitr...
We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitr...