• DocumentCode
    3264456
  • Title

    Block eigenvalue decomposition using nth roots of the identity matrix

  • Author

    Hasan, M. Anwar ; Hasan, Mohammed A.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Minnesota Univ., Duluth, MN, USA
  • Volume
    2
  • fYear
    2002
  • fDate
    10-13 Dec. 2002
  • Firstpage
    2119
  • 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. Efficient implementation of these algorithms using the QR factorization is also presented. Several examples are presented to illustrate the performance of these methods.
  • Keywords
    convergence of numerical methods; eigenvalues and eigenfunctions; matrix algebra; block diagonalization; complex matrices; convergence; eigenvalues; identity matrix; matrix sign function; nonsingular matrix; Acceleration; Eigenvalues and eigenfunctions; Linear systems; Matrices; Matrix decomposition; Riccati equations; Sensor arrays; Signal to noise ratio; Stability analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 2002, Proceedings of the 41st IEEE Conference on
  • ISSN
    0191-2216
  • Print_ISBN
    0-7803-7516-5
  • Type

    conf

  • DOI
    10.1109/CDC.2002.1184843
  • Filename
    1184843