首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Iterative algorithm for solving a class of general Sylvester-conjugate matrix equation \sum_{i = 1}^{s} A_{i}V + \sum_{j = 1}^{t} B_{j}W = \sum_{l = 1}^{m} E_{l}\overline{V}F_{l} + C
Authors:Mohamed A Ramadan  Mokhtar A Abdel Naby  Ahmed M E Bayoumi
Institution:1. Department of Mathematics, Faculty of Science, Menoufia University, Shebeen El-Koom, Egypt
2. Department of Mathematics, Faculty of Education, Ain Shams University, Cairo, Egypt
Abstract:This paper is concerned with iterative solution to general Sylvester-conjugate matrix equation of the form $\sum_{i = 1}^{s} A_{i}V + \sum_{j = 1}^{t} B_{j}W = \sum_{l = 1}^{m} E_{l}\overline{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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号