Title of article
Gradient based iterative algorithm for solving coupled matrix equations
Author/Authors
Zhou، نويسنده , , Bin and Duan، نويسنده , , Guang-Ren and Li، نويسنده , , Zhao-Yan، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2009
Pages
7
From page
327
To page
333
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.
Keywords
Gradient based iteration , Coupled matrix equations , Sylvester equations , Maximal convergence rate , Coupled Markovian jump Lyapunov matrix equations , numerical solutions
Journal title
Systems and Control Letters
Serial Year
2009
Journal title
Systems and Control Letters
Record number
1675227
Link To Document