Skip to Main Content
A new canonical polyadic (CP) decomposition method is proposed in this letter, where one factor matrix is extracted first by using any standard blind source separation (BSS) method and the remainder components are computed efficiently via sequential singular value decompositions of rank-1 matrices. The new approach provides more interpretable factors and it is extremely efficient for ill-conditioned problems. Especially, it overcomes the bottleneck problems, which often cause very slow convergence speed in CP decompositions. Simulations confirmed the validity and efficiency of the proposed method.