Relative gradient based algorithms for general joint diagonalization of complex matrices

DOI10.1007/S11045-015-0328-5zbMATH Open1370.65022OpenAlexW2071769200MaRDI QIDQ2014178FDOQ2014178

Eric Moreau, Tual Trainini

Publication date: 10 August 2017

Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11045-015-0328-5

zbMATH Keywords

independent component analysisnumerical examplesblind source separationgradient algorithmjoint diagonalizationcomplex symmetric matrices

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Canonical forms, reductions, classification (15A21)

Cites Work

• Independent component analysis, a new concept?
• A new gradient method with an optimal stepsize property
• Complex random vectors and ICA models: identifiability, uniqueness, and separability
• Array processing using joint diagonalization
• HIGH-ORDER CONTRASTS FOR SELF-ADAPTIVE SOURCE SEPARATION
• Convergence of conjugate gradient methods with a closed-form stepsize formula

Cited In (1)

• Gradient search non-orthogonal approximate joint diagonalization algorithm

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)