A Relaxed Gradient Based Algorithm for Solving Extended S ylvester‐Conjugate Matrix Equations
Mohamed A. Ramadan, Talaat S. El‐Danaf, Ahmed M. E. Bayoumi · Asian Journal of Control · 2013
Abstract 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.