Skip to main navigation Skip to search Skip to main content

Gradient based iterative algorithm for solving coupled matrix equations

Research output: Contribution to journalArticlepeer-review

Abstract

This paper is concerned with iterative methods for solving a class of coupled matrix equations including the well-known coupled Markovian jump Lyapunov matrix equations as special cases. The proposed method is developed from an optimization point of view and contains the well-known Jacobi iteration, Gauss-Seidel iteration and some recently reported iterative algorithms by using the hierarchical identification principle, as special cases. We have provided analytically the necessary and sufficient condition for the convergence of the proposed iterative algorithm. Simultaneously, the optimal step size such that the convergence rate of the algorithm is maximized is also established in explicit form. The proposed approach requires less computation and is numerically reliable as only matrix manipulation is required. Some other existing results require either matrix inversion or special matrix products. Numerical examples show the effectiveness of the proposed algorithm.

Original languageEnglish
Pages (from-to)327-333
Number of pages7
JournalSystems and Control Letters
Volume58
Issue number5
DOIs
StatePublished - May 2009

Keywords

  • Coupled Markovian jump Lyapunov matrix equations
  • Coupled matrix equations
  • Gradient based iteration
  • Maximal convergence rate
  • Numerical solutions
  • Sylvester equations

Fingerprint

Dive into the research topics of 'Gradient based iterative algorithm for solving coupled matrix equations'. Together they form a unique fingerprint.

Cite this