New Techniques for Block Eigenvalue Decomposition

Mohammed A Hasan, Jawad A.K. Hasan

Research output: Contribution to journalConference articlepeer-review


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. Efficient 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)1464-1469
Number of pages6
JournalProceedings of the American Control Conference
StatePublished - Nov 7 2003
Event2003 American Control Conference - Denver, CO, United States
Duration: Jun 4 2003Jun 6 2003


Dive into the research topics of 'New Techniques for Block Eigenvalue Decomposition'. Together they form a unique fingerprint.

Cite this