Relative gradient based algorithms for general joint diagonalization of complex matrices
From MaRDI portal
Recommendations
- Gradient-based joint block diagonalization algorithms: application to blind separation of FIR convolutive mixtures
- Gradient search non-orthogonal approximate joint diagonalization algorithm
- Non Unitary Joint Block Diagonalization of Complex Matrices Using a Gradient Approach
- A fast algorithm for joint diagonalization with non-orthogonal transformations and its application to blind source separation
- A fast non-unitary joint diagonalization algorithm based on utilizations of parametric structures
Cites work
- A new gradient method with an optimal stepsize property
- Array processing using joint diagonalization
- Complex random vectors and ICA models: identifiability, uniqueness, and separability
- Convergence of conjugate gradient methods with a closed-form stepsize formula
- HIGH-ORDER CONTRASTS FOR SELF-ADAPTIVE SOURCE SEPARATION
- Independent component analysis, a new concept?
Cited in
(6)- Optimal Joint Diagonalization of Complex Symmetric Third-Order Tensors. Application to Separation of Non Circular Signals
- A fast algorithm for joint diagonalization with non-orthogonal transformations and its application to blind source separation
- A fast non-unitary joint diagonalization algorithm based on utilizations of parametric structures
- Non Unitary Joint Block Diagonalization of Complex Matrices Using a Gradient Approach
- Gradient search non-orthogonal approximate joint diagonalization algorithm
- Preconditioned optimization algorithms solving the problem of the non unitary joint block diagonalization: application to blind separation of convolutive mixtures
This page was built for publication: Relative gradient based algorithms for general joint diagonalization of complex matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014178)