A two-step algorithm for joint EigenValue decomposition - Application to canonical polyadic decomposition of fluorescence spectra

Abstract In this paper, we propose a new Joint EigenValue Decomposition (JEVD) algorithm. JEVD problem belongs to the family of joint diagonalization problems. Hence, JEVD algorithms aim at estimating the common basis of eigenvectors of a matrix set. This problem occurs in many signal processing applications. It has notably allowed to develop efficient algorithms for the Canonical Polyadic Decomposition (CPD) of multiway arrays. The proposed JEVD algorithm is based on an original two-step approach. The first step consists in transforming the considered matrix set into a set of positive definite matrices. In this purpose, we introduce an ad hoc joint symmetrization algorithm. This first step allows us to transform the JEVD problem into a simpler orthogonal joint diagonalization problem. The second step is then performed using an efficient orthogonal joint diagonalization algorithm of the literature. Eventually, the performance of the proposed approach is deeply investigated in the CPD context of multidimensional fluorescence data. More particularly, we consider difficult scenarios such as the cases of an overestimated rank and highly correlated factors.