A relaxed gradient based algorithm for solving extended Sylvester-conjugate matrix equations
Ramadan, M.A.; Ahmed M. E. Bayoumi;
Abstract
© 2013 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society. 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.
Other data
| Title | A relaxed gradient based algorithm for solving extended Sylvester-conjugate matrix equations | Authors | Ramadan, M.A. ; Ahmed M. E. Bayoumi | Issue Date | 2014 | Journal | Asian Journal of Control | DOI | 5 1334 http://www.scopus.com/inward/record.url?eid=2-s2.0-84904972713&partnerID=MN8TOARS 16 10.1002/asjc.805 |
Scopus ID | 2-s2.0-84904972713 |
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.