On the solutions to Sylvester‐conjugate periodic matrix equations via iteration

The problem of solving a class of Sylvester‐conjugate periodic matrix equations is investigated in this paper. Utilising conjugate gradient method, an iterative algorithm is provided, from which a matrix sequence can be generated to approximate the unknown matrix of the equation to be solved. Theore...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IET control theory & applications Jg. 17; H. 3; S. 307 - 317
Hauptverfasser: Zhang, Lei, Li, Pengxiang, Han, Mengqi, Zhang, Yanfeng, Chang, Rui, Zhang, Jinhua
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Stevenage John Wiley & Sons, Inc 01.02.2023
Wiley
Schlagworte:
Algorithms
Conjugate gradient method
Iterative algorithms
Parameter estimation
ISSN:1751-8644, 1751-8652
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The problem of solving a class of Sylvester‐conjugate periodic matrix equations is investigated in this paper. Utilising conjugate gradient method, an iterative algorithm is provided, from which a matrix sequence can be generated to approximate the unknown matrix of the equation to be solved. Theoretical derivation proves that the proposed algorithm is convergent starting from any initial value, and simulation examples show the effectiveness of the proposed algorithm.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1751-8644
1751-8652
DOI:10.1049/cth2.12312