The full-rank JGI algorithm for the generalized coupled Sylvester-transpose matrix equations

In this paper, we focus on the iterative solutions of the generalized coupled Sylvester-transpose matrix equations. Based on the Jacobi iterative algorithm and the principle of hierarchical identification, the full-row rank Jacobi gradient based iterative (RRJGI) algorithm and the full-column rank J...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Conference on Control, Automation and Systems (Online) s. 832 - 837
Hlavní autoři: Qi, Rui, Song, Caiqin
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: ICROS 17.10.2023
Témata:
Automation
Control systems
Convergence
Convergence factor
Coupled Sylvester-transpose matrix equations
Iterative algorithms
Jacobian matrices
The full-row rank Jacobi gradient based iterative algorithm
ISSN:2642-3901
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we focus on the iterative solutions of the generalized coupled Sylvester-transpose matrix equations. Based on the Jacobi iterative algorithm and the principle of hierarchical identification, the full-row rank Jacobi gradient based iterative (RRJGI) algorithm and the full-column rank Jacobi gradient based iterative (CRJGI) algorithm are proposed. It is proved that the proposed algorithms converge to the exact solutions for any initial matrices when the parameter factor µ satisfies certain conditions and the sufficient and necessary conditions for the convergence of the new algorithms are given. Finally, an example is provided to demonstrate the effectiveness and superiority of the presented algorithms.
ISSN:2642-3901
DOI:10.23919/ICCAS59377.2023.10316954