Tensor decompositions, alternating least squares and other tales
This work was originally motivated by a classification of tensors proposed by Richard Harshman. In particular, we focus on simple and multiple 'bottlenecks', and on 'swamps'. Existing theoretical results are surveyed, some numerical algorithms are described in details, and their numerical complexity is calculated. In particular, the interest in using the enhanced line search (ELS) enhancement in these algorithms is discussed. Computer simulations feed this discussion. Copyright (C) 2009 John Wiley & Sons, Ltd.
tensor rank parafac canonical decomposition three-way array degeneracy computational complexity