• DocumentCode
    1492426
  • Title

    Efficient iterative method for solving the second-order sylvester matrix equation EVF2-AVF-CV=BW

  • Author

    Dehghan, Mehdi ; Hajarian, Masoud

  • Author_Institution
    Dept. of Appl. Math., Amirkabir Univ. of Technol., Tehran, Iran
  • Volume
    3
  • Issue
    10
  • fYear
    2009
  • fDate
    10/1/2009 12:00:00 AM
  • Firstpage
    1401
  • Lastpage
    1408
  • Abstract
    The second-order Sylvester matrix equation EVF 2-AVF-CV=BW (including the generalised Sylvester matrix equation, normal Sylvester matrix equation and Lyapunov matrix equation as special cases) over unknown matrix pair [V, W], has wide applications in many fields. In the present study, the authors propose an iterative method to solve the second-order Sylvester matrix equation. The proposed iterative method does not depend on the Jordan form of the matrix F. By this iterative method, the solvability of the matrix equation can be determined automatically over unknown matrix pair [V, W]ne0. When the matrix equation is solvable, its solution pair can be obtained within finite iterative steps, and its least Frobenius norm solution pair can be obtained by choosing suitable initial matrix pair. Furthermore, its optimal approximation solution pair to a given matrix pair can be derived by finding the least norm solution pair of a new matrix equation. A numerical example is given to show the efficiency of the proposed method.
  • Keywords
    approximation theory; iterative methods; matrix algebra; finite iterative method; initial matrix pair; least Frobenius norm; optimal approximation solution pair; second-order Sylvester matrix equation; unknown matrix pair;
  • fLanguage
    English
  • Journal_Title
    Control Theory & Applications, IET
  • Publisher
    iet
  • ISSN
    1751-8644
  • Type

    jour

  • DOI
    10.1049/iet-cta.2008.0450
  • Filename
    5278094