Iterative algorithm for solving a class of general Sylvester-conjugate matrix equation ∑i=1s AiV + ∑j=1t BjW = ∑l=1m ElV̄Fl + C

Ramadan, M.A. ; Ahmed M. E. Bayoumi 


Abstract


This paper is concerned with iterative solution to general Sylvester-conjugate matrix equation of the form ∑ i=1 s A i V + ∑ j=1 t B j W = ∑ l=1 m E l V̄F l + C. An iterative algorithm is established to solve this matrix equation. When this matrix equation is consistent, for any initial matrices, the solutions can be obtained within finite iterative steps in the absence of round off errors. Some lemmas and theorems are stated and proved where the iterative solutions are obtained. Finally, a numerical example is given to verify the effectiveness of the proposed algorithm. © 2013 Korean Society for Computational and Applied Mathematics.


Other data

Issue Date 2014
Journal Journal of Applied Mathematics and Computing 
URI http://research.asu.edu.eg/123456789/553
DOI 1-2
99
http://www.scopus.com/inward/record.url?eid=2-s2.0-84891825422&partnerID=MN8TOARS
44
10.1007/s12190-013-0683-z


Recommend this item

CORE Recommender
3
Citations

3
Views


Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.