Non Unitary Joint Block Diagonalization of Complex Matrices Using a Gradient Approach
From MaRDI portal
Publication:3608546
DOI10.1007/978-3-540-74494-8_26zbMATH Open1172.94413OpenAlexW1495275937MaRDI QIDQ3608546FDOQ3608546
Authors: Hicham Ghennioui, Nadège Thirion-Moreau, Eric Moreau, Abdellah Adib, Driss Aboutajdine
Publication date: 5 March 2009
Published in: Independent Component Analysis and Signal Separation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74494-8_26
Recommendations
- Preconditioned optimization algorithms solving the problem of the non unitary joint block diagonalization: application to blind separation of convolutive mixtures
- Gradient-based joint block diagonalization algorithms: application to blind separation of FIR convolutive mixtures
- An Algebraic Non Orthogonal Joint Block Diagonalization Algorithm for Blind Separation of Convolutive Mixtures of Sources
- Relative gradient based algorithms for general joint diagonalization of complex matrices
- Gradient search non-orthogonal approximate joint diagonalization algorithm
Cited In (5)
- A Geometric Framework for Non-Unitary Joint Diagonalization of Complex Symmetric Matrices
- An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization
- Preconditioned optimization algorithms solving the problem of the non unitary joint block diagonalization: application to blind separation of convolutive mixtures
- An Algebraic Non Orthogonal Joint Block Diagonalization Algorithm for Blind Separation of Convolutive Mixtures of Sources
- Gradient-based joint block diagonalization algorithms: application to blind separation of FIR convolutive mixtures
This page was built for publication: Non Unitary Joint Block Diagonalization of Complex Matrices Using a Gradient Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608546)