Conjugate gradient-based iterative algorithm for solving generalized periodic coupled Sylvester matrix equations

被引:7
|
作者
Chen, Zebin [1 ]
Chen, Xuesong [1 ]
机构
[1] Guangdong Univ Technol, Sch Math & Stat, Guangzhou 510520, Peoples R China
关键词
LEAST-SQUARES ALGORITHM; TRANSPOSE LINEAR MATRIX; POLE ASSIGNMENT; ROBUST; IDENTIFICATION; SYSTEMS;
D O I
10.1016/j.jfranklin.2022.09.049
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper focuses on constructing a conjugate gradient-based (CGB) method to solve the generalized periodic coupled Sylvester matrix equations in complex space. The presented method is developed from a point of conjugate gradient methods. It is proved that the presented method can find the solution of the considered matrix equations within finite iteration steps in the absence of round-off errors by theoretical derivation. Some numerical examples are provided to verify the convergence performance of the presented method, which is superior to some existing numerical algorithms both in iteration steps and computation time. (c) 2022 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:9925 / 9951
页数:27
相关论文
共 50 条