Tensor decomposition can reduce to rank-one approximations - Archive ouverte HAL
Communication Dans Un Congrès Année : 2010

Tensor decomposition can reduce to rank-one approximations

Résumé

The Canonical Polyadic (CP) decomposition of a tensor is difficult to compute. Even algorithms computing the best rank-one approximation are not entirely satisfactory. And deflation approaches (successive rank-1 tensor approximations) do not work for tensors. However, there are cases where successive rank-1 matrix approximations can help in computing the CP decomposition. This is what we investigate in this talk. In particular, we analyze the cases where loading matrices are banded and structured, e.g. Toeplitz or Hankel.
Fichier non déposé

Dates et versions

hal-00985606 , version 1 (30-04-2014)

Identifiants

  • HAL Id : hal-00985606 , version 1

Citer

Pierre Comon. Tensor decomposition can reduce to rank-one approximations. 26th GAMM on Tensor Approximations and High-Dimensional Problems, Feb 2010, Leipzig, Germany. ⟨hal-00985606⟩
94 Consultations
0 Téléchargements

Partager

More