A modified gradient-based algorithm for solving extended Sylvester-conjugate matrix equationsRamadan, M.A. ; Ahmed M. E. Bayoumi
Abstract© 2017 Chinese Automatic Control Society and John Wiley & Sons Australia, Ltd In this paper, we present a modified gradient-based algorithm for solving extended Sylvester-conjugate matrix equations. The idea is from the gradient-based method introduced in  and the relaxed gradient-based algorithm proposed in  . The convergence analysis of the algorithm is investigated. We show that the iterative solution converges to the exact solution for any initial value based on some appropriate assumptions. A numerical example is given to illustrate the effectiveness of the proposed method and to test its efficiency and accuracy compared with those presented in  and  .
|Issue Date||2018||Journal||Asian Journal of Control||URI||http://research.asu.edu.eg/123456789/556||DOI||1
Recommend this item
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.