Iterative algorithm for the reflexive solutions of the generalized Sylvester matrix equation | ||||
| Journal of the Egyptian Mathematical Society | ||||
| Volume 27, Issue 1, 2019, Page 1-16 PDF (815.51 K) | ||||
| DOI: 10.1186/s42787-019-0030-0 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| Mohamed A. Ramadan; Naglaa M. El–shazly; Basem I. Selim | ||||
| Department of Mathematics and Computer Science, Faculty of Science, Menoufia University, Shebein El-Koom, Egypt | ||||
| Abstract | ||||
| In this paper, the generalized Sylvester matrix equation AV + BW = EVF + C over reflexive matrices is considered. An iterative algorithm for obtaining reflexive solutions of this matrix equation is introduced. When this matrix equation is consistent over reflexive solutions then for any initial reflexive matrix, the solution can be obtained within finite iteration steps. Furthermore, the complexity and the convergence analysis for the proposed algorithm are given. The least Frobenius norm reflexive solutions can also be obtained when special initial reflexive matrices are chosen. Finally, numerical examples are given to illustrate the effectiveness of the proposed algorithm. | ||||
| Keywords | ||||
| Generalized Sylvester matrix equation; Iterative method; Reflexive matrices; Least Frobenius norm solution | ||||
|
Statistics Article View: 39 PDF Download: 18 |
||||
