Key points are not available for this paper at this time.
The coupled canonical polyadic decomposition (CPD) is an emerging tool for the joint analysis of multiple data sets in signal processing and statistics. Despite their importance, linear algebra based algorithms for coupled CPDs have not yet been developed. In this paper, we first explain how to obtain a coupled CPD from one of the individual CPDs. Next, we present an algorithm that directly takes the coupling between several CPDs into account. We extend the methods to single and coupled decompositions in multilinear rank- (Lₑ, ₍, Lₑ, ₍, 1) terms. Finally, numerical experiments demonstrate that linear algebra based algorithms can provide good results at a reasonable computational cost.
Sørensen et al. (2015) studied this question.