Block eigenvalue decomposition using nth roots of the identity matrix

Mohammed A Hasan, Jawad A.K. Hasan

Research output: Contribution to journalConference articlepeer-review

15 Scopus citations

Abstract

The matrix sign function has been utilized in recent years for block diagonalization of complex matrices. In this paper, nth roots of the identity matrix including the matrix sector function are utilized for block diagonalization of general matrices. Specifically, we derive classes of rational fixed point functions for nth roots of any nonsingular matrix which are then used for block eigen-decomposition. Based on these functions, algorithms may have any desired order of convergence are developed. E cient implementation of these algorithms using the QR factorization is also presented. Several examples are presented to illustrate the performance of these methods.

Original languageEnglish (US)
Pages (from-to)2119-2124
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume2
StatePublished - Dec 1 2002
Event41st IEEE Conference on Decision and Control - Las Vegas, NV, United States
Duration: Dec 10 2002Dec 13 2002

Fingerprint Dive into the research topics of 'Block eigenvalue decomposition using nth roots of the identity matrix'. Together they form a unique fingerprint.

Cite this