Tensor Decompositions with Banded Matrix Factors

Abstract : The computation of the model parameters of a Canonical Polyadic Decomposition (CPD), also known as the parallel factor (PARAFAC) or canonical decomposition (CANDECOMP) or CP decomposition, is typically done by resorting to iterative algorithms, e.g. either iterative alternating least squares type or descent methods. In many practical problems involving tensor decompositions such as signal processing, some of the matrix factors are banded. First, we develop methods for the computation of CPDs with one banded matrix factor. It results in best rank-1 tensor approximation problems. Second, we propose methods to compute CPDs with more than one banded matrix factor. Third, we extend the developed methods to also handle banded and structured matrix factors such as Hankel or Toeplitz. Computer results are also reported.
Type de document :
Article dans une revue
Linear Algebra and its Applications, Elsevier, 2013, 438 (1), pp.919-941. <10.1016/j.laa.2011.10.044>

Contributeur : Pierre Comon <>
Soumis le : mercredi 3 juillet 2013 - 16:29:18
Dernière modification le : jeudi 6 mars 2014 - 11:49:57
Document(s) archivé(s) le : vendredi 4 octobre 2013 - 04:12:22


Fichiers produits par l'(les) auteur(s)




Mikael Sorensen, Pierre Comon. Tensor Decompositions with Banded Matrix Factors. Linear Algebra and its Applications, Elsevier, 2013, 438 (1), pp.919-941. <10.1016/j.laa.2011.10.044>. <hal-00740572v2>



Consultations de
la notice


Téléchargements du document