By Topic

An optimal step size relative gradient based joint diagonalization algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ghennioui, H. ; Lab. LSEET, Intitut des Sci. de l''Ingenieur de Toulon et du Var, La Valette-du-Var, France ; Thirion-Moreau, N. ; Moreau, E.

This paper addresses the problem of the non unitary joint diagonalization of a given set of complex matrices. We focus on gradient based algorithms. A new algorithm based on a relative gradient approach is suggested. Its algorithmic complexity is established and the optimal stepsize is calculated algebraically at each iteration to decrease the number of iterations required to reach the convergence while discarding the often difficult stepsize choice problem. Computer simulations are provided to illustrate the behavior of this algorithm in different contexts. It is also compared with other existing joint diagonalization algorithms.

Published in:

Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2009 3rd IEEE International Workshop on

Date of Conference:

13-16 Dec. 2009