A finite iterative algorithm for the solution of Sylvester-conjugate matrix equations AV+BW=EV-F+C and AV+BW-=EV-F+C

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


Abstract


In this paper, we consider two iterative algorithms for the Sylvester-conjugate matrix equation AV+BW=EV-F+C and AV+BW-=EV-F+C. When these two matrix equations are 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. Two numerical examples are given to illustrate the effectiveness of the proposed method. © 2013 Elsevier Ltd.


Other data

Issue Date 2013
Journal Mathematical and Computer Modelling 
URI http://research.asu.edu.eg/123456789/550
DOI 11-12
1738
http://www.scopus.com/inward/record.url?eid=2-s2.0-84887017857&partnerID=MN8TOARS
58
10.1016/j.mcm.2013.06.010


Recommend this item

CORE Recommender
3
Citations

1
Views


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