Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Pierre Comon <>
Submitted on : Wednesday, July 3, 2013 - 4:29:18 PM
Last modification on : Wednesday, October 14, 2020 - 1:56:03 PM
Long-term archiving on: : Friday, October 4, 2013 - 4:12:22 AM


Files produced by the author(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⟩



Record views


Files downloads