article · Optimal Control Applications and Methods
Abstract To 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.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1002/oca.3112
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
