Some Clarifications of the CANDECOMP Algorithm Applied to INDSCAL
- 1 June 1991
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 56 (2) , 317-326
- https://doi.org/10.1007/bf02294465
Abstract
Carroll and Chang have claimed that CANDECOMP applied to symmetric matrices yields equivalent coordinate matrices, as needed for INDSCAL. Although this claim has appeared to be valid for all practical purposes, it has gone without a rigorous mathematical footing. The purpose of the present paper is to clarify CANDECOMP in this respect. It is shown that equivalent coordinate matrices are not granted at global minima when the symmetric matrices are not Gramian, or when these matrices are Gramian but the solution not globally optimal.Keywords
This publication has 4 references indexed in Scilit:
- Explicit Candecomp/Parafac Solutions for a Contrived 2 × 2 × 2 Array of Rank ThreePsychometrika, 1988
- Note on Convergence of MinresMultivariate Behavioral Research, 1988
- Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decompositionPsychometrika, 1970
- The approximation of one matrix by another of lower rankPsychometrika, 1936