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...

Full description

Saved in:
Bibliographic Details
Published in:IET control theory & applications Vol. 17; no. 3; pp. 307 - 317
Main Authors: Zhang, Lei, Li, Pengxiang, Han, Mengqi, Zhang, Yanfeng, Chang, Rui, Zhang, Jinhua
Format: Journal Article
Language:English
Published: Stevenage John Wiley & Sons, Inc 01.02.2023
Wiley
Subjects:
Algorithms
Conjugate gradient method
Iterative algorithms
Parameter estimation
ISSN:1751-8644, 1751-8652
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1751-8644
1751-8652
DOI:10.1049/cth2.12312