Ming 1984- (2012-09). On Partial and Generic Uniqueness of Block Term Tensor Decomposition in Signal Processing. Doctoral Dissertation. Yang - Texas A&M University (TAMU) Scholar

In this dissertation, we study the partial and generic uniqueness of block term tensor decompositions in signal processing. We present several conditions for generic uniqueness of tensor decompositions of multilinear rank (1, L1, L1), ..., (1, LR, LR) terms. Our proof is based on algebraic geometric methods. Mathematical preliminaries for this dissertation are multilinear algebra, and classical algebraic geometry. In geometric language, we prove that the joins of relevant subspace varieties are not tangentially weakly defective. We also give conditions for partial uniqueness of block term tensor decompositions by proving that the joins of relevant subspace varieties are not defective. The main result is the following. For a tensor Y belong to the tensor product of three complex vector spaces of dimensions I, J, K, we assume that L1, L2, ..., LR is from small to large, K is bigger or equal to J, and J is strictly bigger than LR. If the dimension of ambient space is strictly less than IJK, then for general tensors among those admitting block term tensor decomposition, the block term tensor decomposition is partially unique under the condition that the binomial coefficient indexed by J and LR is bigger or equal to R, and I is bigger or equal to 2; it has infinitely many expressions under the condition IJK is strictly less than the sum from L_1^2 to L_R^2; it is essentially unique under any of the following there conditions: (i) I is bigger or equal to 2, J, K is bigger or equal to the sum from L1 to LR (ii) R is 2, I is bigger or equal to 2 (iii) I is bigger or equal to R, K is bigger or equal to the sum from L1 to LR, J is bigger or equal to 2LR, the binomial coefficient indexed by J and LR is bigger or equal to R.