A New Algorithm for Complex Non-Orthogonal Joint Diagonalization Based on Shear and Givens Rotations
From MaRDI portal
Publication:4579122
Abstract: This paper introduces a new algorithm to approximate non orthogonal joint diagonalization (NOJD) of a set of complex matrices. This algorithm is based on the Frobenius norm formulation of the JD problem and takes advantage from combining Givens and Shear rotations to attempt the approximate joint diagonalization (JD). It represents a non trivial generalization of the JDi (Joint Diagonalization) algorithm (Souloumiac 2009) to the complex case. The JDi is first slightly modified then generalized to the CJDi (i.e. Complex JDi) using complex to real matrix transformation. Also, since several methods exist already in the literature, we propose herein a brief overview of existing NOJD algorithms then we provide an extensive comparative study to illustrate the effectiveness and stability of the CJDi w.r.t. various system parameters and application contexts.
Cited in
(5)- Diagonality measures of Hermitian positive-definite matrices with application to the approximate joint diagonalization problem
- scientific article; zbMATH DE number 4199332 (Why is no real title available?)
- Development of the two real signals blind separation method using fourth-order cumulants
- Uniqueness of linear factorizations into independent subspaces
- Nonorthogonal Joint Diagonalization Algorithm Based on Trigonometric Parameterization
This page was built for publication: A New Algorithm for Complex Non-Orthogonal Joint Diagonalization Based on Shear and Givens Rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579122)
