For EDITORS

For READERS

All Issues

Vol.15, 2025
Vol.14, 2024
Vol.10, 2020
Vol.9, 2019
Vol.8, 2018
Vol.7, 2017
Vol.6, 2016
Vol.5, 2015
Vol.4, 2014
Vol.3, 2013
Vol.2, 2012
Vol.1, 2011
Volume 15, Number 1, 2025, Pages -                                                                DOI:10.11948/JAAC-2024-0085
Iterative algorithms for the generalized discrete-time periodic Sylvester transpose matrix equations with application in the periodic state observer design of linear systems
Rui Qi,Caiqin Song
Keywords:The generalized discrete-time periodic Sylvester transpose matrix equations  iterative algorithm  iterative solutions  Convergence performance
Abstract:
      In this work, four iterative algorithms are provided for solving generalized discrete-time periodic Sylvester transpose matrix equations. Based on the Jacobi iterative algorithm and hierarchical identification principle, the present work provides the full-row rank Jacobi gradient iterative (RRJGI) algorithm, the full-row rank accelerated Jacobi gradient iterative (RRAJGI) algorithm, the full-column rank Jacobi gradient iterative (CRJGI) algorithm and the full-column rank accelerated Jacobi gradient iterative (CRAJGI) algorithm. The convergence of the algorithms are proved, and it is concluded that the proposed iterative methods are convergent under certain conditions for arbitrary initial matrices. Numerical results show the feasibility of the proposed algorithms and its superiority compared with other algorithms. Finally, an application example for the periodic state observer design of linear systems is given.
PDF      Download reader