A modified gradient-based algorithm for solving extended Sylvester-conjugate matrix equations
Ramadan, 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 [14] and the relaxed gradient-based algorithm proposed in [16] . 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 [14] and [16] .
Other data
Title | A modified gradient-based algorithm for solving extended Sylvester-conjugate matrix equations | Authors | Ramadan, M.A. ; Ahmed M. E. Bayoumi | Issue Date | 2018 | Journal | Asian Journal of Control | DOI | 1 228 http://www.scopus.com/inward/record.url?eid=2-s2.0-85020726903&partnerID=MN8TOARS 20 10.1002/asjc.1574 |
Scopus ID | 2-s2.0-85020726903 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.