Iterative methods for the canonical decomposition of multi-way arrays: application to blind underdetermined mixture identification
type: Item
instance of: scholarly article
title: Iterative methods for the canonical decomposition of multi-way arrays: application to blind underdetermined mixture identification
zbMATH Open document ID: 1217.94051
author: Ahmad Karfoul
author: Laurent Albera
author: Lieven De Lathauwer
published in: Signal Processing
publication date: 2011-07-27T00:00:00Z
Mathematics Subject Classification ID: 94A12
zbMATH DE Number: 5933245
zbMATH Keywords: canonical decomposition (CAND)
zbMATH Keywords: parallel factor analysis (PARAFAC)
zbMATH Keywords: multi-way data analysis
zbMATH Keywords: alternating least squares (ALS)
zbMATH Keywords: Hermitian multi-way arrays
zbMATH Keywords: blind underdetermined mixture identification (BUMI)
describes a project that uses: PARAFAC
MaRDI profile type: Publication
full work available at URL: j.sigpro.2011.02.003
OpenAlex ID: W2106138821
cites work: A Multilinear Singular Value Decomposition
cites work: A singular value decomposition algorithm based on solving hyperplane constrained nonlinear systems
cites work: Decomposition of quantics in sums of powers of linear forms
cites work: Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition
cites work: Applied Multiway Data Analysis
cites work: Blind identification of under-determined mixtures based on the characteristic function
cites work: Blind Identification of Overcomplete MixturEs of sources (BIOME)
cites work: Blind channel identification algorithms based on the Parafac decomposition of cumulant tensors: the single and multiuser cases
cites work: A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
cites work: Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
cites work: Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
cites work: A comparison of algorithms for fitting the PARAFAC model
cites work: PARAFAC: Parallel factor analysis
cites work: Enhanced Line Search: A Novel Method to Accelerate PARAFAC
cites work: An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA
cites work: Q3359644
cites work: Fourth-order blind identification of underdetermined mixtures of sources (FOBIUM)
cites work: Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
cites work: On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
cites work: Generic and typical ranks of multi-way arrays
cites work: On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition
cites work: Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints
cites work: Singularities of linear systems and the Waring problem
cites work: Typical tensorial rank
cites work: Q3136730
cites work: Jacobi Angles for Simultaneous Diagonalization
cites work: An Algebraic Non Orthogonal Joint Block Diagonalization Algorithm for Blind Separation of Convolutive Mixtures of Sources
cites work: Non-orthogonal joint diagonalization in the least-squares sense with application in blind source separation
cites work: On the non-existence of optimal solutions and the occurrence of ``degeneracy'' in the CANDECOMP/PARAFAC model
cites work: Sufficient conditions for uniqueness in Candecomp/Parafac and Indscal with random component matrices
DOI: 10.1016/J.SIGPRO.2011.02.003
description: scientific article; zbMATH DE number 5933245