The CANDECOMP/PARAFAC (CP) model decomposes a three-way array into a prespecified number of R factors and a residual array by minimizing the sum of squares of the latter. It is well known that an optimal solution for CP need not exist. We show that if an optimal CP solution does not exist, then any sequence …

The CANDECOMP algorithm for the PARAFAC analysis of n × m × p three-way arrays is adapted to handle arrays in which n > rnp more efficiently. For such arrays, the adapted algorithm needs less memory space to store the data during the iterations, and uses less com- putation time than the original CANDECOMP …