An iterative deflation algorithm for exact CP tensor decomposition

The Canonical Polyadic (CP) tensor decomposition has become an attractive mathematical tool these last ten years in various fields. Yet, efficient algorithms are still lacking to compute the full CP decomposition, whereas rank-one approximations are rather easy to compute. We propose a new deflation-based iterative algorithm allowing to compute the full CP decomposition, by resorting only to rank-one approximations. An analysis of convergence issues is included, as well as computer experiments. Our theoretical and experimental results show that the algorithm converges almost surely.