A fast approximate joint diagonalization algorithm using a criterion with a block diagonal weight matrix

摘要

We propose a new algorithm for approximate joint diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especially in large-scale (high-dimensional) problems; and an ability to incorporate