Joint Approximate Diagonalization of Positive Definite Hermitian Matrices
Top Cited Papers
- 1 January 2001
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 22 (4), 1136-1152
- https://doi.org/10.1137/s089547980035689x
Abstract
This paper provides an iterative algorithm to jointly approximately diagonalize K Hermitian positive definite matrices ${\bf\Gamma}_1$, \dots, ${\bf\Gamma}_K$. Specifically, it calculates the matrix B which minimizes the criterion $\sum_{k=1}^K n_k [\log \det\diag(\B\C_k\B^*) - \log\det(\B\C_k\B^*)]$, nk being positive numbers, which is a measure of the deviation from diagonality of the matrices BCkB*$. The convergence of the algorithm is discussed and some numerical experiments are performed showing the good performance of the algorithm.
Keywords
This publication has 4 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- Blind separation of mixture of independent sources through a quasi-maximum likelihood approachIEEE Transactions on Signal Processing, 1997
- A blind source separation technique using second-order statisticsIEEE Transactions on Signal Processing, 1997
- An Algorithm for Simultaneous Orthogonal Transformation of Several Positive Definite Symmetric Matrices to Nearly Diagonal FormSIAM Journal on Scientific and Statistical Computing, 1986