Modified Gradient Based Iterative Algorithm for Solving the Generalized Sylvester-Conjugate Matrix Equation over Generalized Centro-Symmetric Matrices | ||||
| Al-Azhar Bulletin of Science | ||||
| Volume 2024, Issue 8, August 2024 | ||||
| DOI: 10.58675/2636-3305.1673 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| Naglaa M. El-Shazly; Mohamed A. Ramadan; Marwa H. El-Sharway | ||||
| Mathematics and Computer Science Department, Faculty of Science, Menoufia University, Egypt | ||||
| Abstract | ||||
| We have recently established two techniques of relaxed gradient based form in order to solve the generalized Sylvester-conjugate matrix problem through centrosymmetric as well as the centro-Hermitian matrices. The major target of this paper is to construct a new iterative strategy to obtain the solution of the aforementioned matrix equation through generalized centro-symmetric matrices by applying a modulated method of gradient based form. The performance of our proposed technique is compared to that the iterative algorithm of the relaxed gradient based form over centrosymmetric matrices. To confirm that our constructed technique is convergent, we set up some conditions. Finally, we illustrate various numerical tests to ensure the genuineness of our theoretical results as well as the effectiveness of the suggested algorithm to find the solution of the Sylvester-conjugate matrix equation of the generalized form. | ||||
|
Statistics Article View: 17 |
||||
