4.5 Article

Gradient based iterative algorithm for solving coupled matrix equations

Journal

SYSTEMS & CONTROL LETTERS
Volume 58, Issue 5, Pages 327-333

Publisher

ELSEVIER
DOI: 10.1016/j.sysconle.2008.12.004

Keywords

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

Funding

  1. National Natural Science Foundation of China [60710002]
  2. Program for Changjiang Scholars and Innovative Research Team in University

Ask authors/readers for more resources

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. (C) 2008 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available