Premium
Tensor decompositions, alternating least squares and other tales
Author(s) -
Comon P.,
Luciani X.,
de Almeida A. L. F.
Publication year - 2009
Publication title -
journal of chemometrics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.47
H-Index - 92
eISSN - 1099-128X
pISSN - 0886-9383
DOI - 10.1002/cem.1236
Subject(s) - tensor (intrinsic definition) , simple (philosophy) , focus (optics) , line (geometry) , work (physics) , line search , computer science , least squares function approximation , swamp , algorithm , mathematics , theoretical computer science , statistics , epistemology , engineering , pure mathematics , physics , geometry , philosophy , mechanical engineering , optics , ecology , computer security , radius , estimator , biology
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 © 2009 John Wiley & Sons, Ltd.