Balanced simultaneous schur decomposition for joint eigenvalue estimation

Fu Tuo*, Jin Shi, Gao Xiqi

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

We address the problem of joint eigenvalue estimation for the non-defective commuting set of matrices A. We propose a procedure revealing the joint eigenstructure by simultaneous diagonalization of A with simultaneous Schur decomposition (SSD) and balance procedure alternately for performance considerations and also to overcome the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations. We show that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i.e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Numerical experiments conducted in a multi-dimensional harmonic retrieval application suggest that the method presented here converges considerably faster with an analyzable performance than the methods based on only unitary transformation for matrices which are not near to normality.

Original languageEnglish
Title of host publication2006 International Conference on Communications, Circuits and Systems, ICCCAS, Proceedings - Signal Processing
Pages356-360
Number of pages5
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event2006 International Conference on Communications, Circuits and Systems, ICCCAS - Guilin, China
Duration: 25 Jun 200628 Jun 2006

Publication series

Name2006 International Conference on Communications, Circuits and Systems, ICCCAS, Proceedings
Volume1

Conference

Conference2006 International Conference on Communications, Circuits and Systems, ICCCAS
Country/TerritoryChina
CityGuilin
Period25/06/0628/06/06

Fingerprint

Dive into the research topics of 'Balanced simultaneous schur decomposition for joint eigenvalue estimation'. Together they form a unique fingerprint.

Cite this