Affiliation:
1. Department of Mathematics, Faculty of Education Ain Shams University Cairo Egypt
Abstract
AbstractTo improve the convergence of the gradient iterative (GI) algorithm and the Jacobi‐gradient iterative (JGI) algorithm [Bayoumi, Appl Math Inf Sci, 2021], a shift‐splitting Jacobi‐gradient iterative (SSJGI) algorithm for solving the matrix equation is presented in this paper, which is based on the splitting of the coefficient matrices. The proposed algorithm converges to the exact solution for any initial value with some conditions. To demonstrate the effectiveness of the SSJGI algorithm and to compare it to the GI algorithm and the JGI algorithm [Bayoumi, Appl Math Inf Sci, 2021], numerical examples are provided.
Reference25 articles.
1. Iterative solutions to the extended Sylvester-conjugate matrix equations
2. Jacobi‐gradient iterative algorithm for solving the matrix equation A𝒱−𝒱‾B=C;Bayoumi AME;Appl Math Inf Sci,2021
3. A shift-splitting hierarchical identification method for solving Lyapunov matrix equations
4. A shift‐splitting Jacobi‐gradient algorithm for Lyapunov matrix equations arising from control theory;Li SK;J Comput Anal Appl,2011
5. A Relaxed Gradient Based Algorithm for Solving Extended Sylvester-Conjugate Matrix Equations
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献