A RELAXED GRADIENT BASED ALGORITHM FOR SOLVING EXTENDED SYLVESTER-CONJUGATE MATRIX EQUATIONS

被引:18
|
作者
Ramadan, Mohamed A. [1 ]
El-Danaf, Talaat S. [1 ]
Bayoumi, Ahmed M. E. [2 ]
机构
[1] Menoufia Univ, Dept Math, Fac Sci, Shibin Al Kawm, Egypt
[2] Ain Shams Univ, Fac Educ, Dept Math, Cairo, Egypt
关键词
Sylvester equations; Frobenius norm; relaxation parameters; GENERALIZED REFLEXIVE SOLUTIONS; LEAST-SQUARES IDENTIFICATION; FINITE ITERATIVE ALGORITHMS; MULTIVARIABLE SYSTEMS; COMPLEX MATRICES; CONSIMILARITY; AXB=C;
D O I
10.1002/asjc.805
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a relaxed gradient based algorithm for solving extended Sylvester-conjugate matrix equations by considering a relaxation parameter is proposed. The convergence analysis of the algorithm is investigated. Theoretical analysis shows that the new method converges under certain assumptions. A numerical example is given to illustrate effectiveness of the proposed method and to test its efficiency compared with an existing one.
引用
收藏
页码:1334 / 1341
页数:8
相关论文
共 50 条