Cart (Loading....) | Create Account
Close category search window
 

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.