Back to Search
Start Over
A shift‐splitting Jacobi‐gradient iterative algorithm for solving the matrix equation A풱−풱‾B=C.
- Source :
- Optimal Control - Applications & Methods; Jul2024, Vol. 45 Issue 4, p1593-1602, 10p
- Publication Year :
- 2024
-
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 A풱−풱‾B=C 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- ALGORITHMS
EQUATIONS
MATRICES (Mathematics)
MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 01432087
- Volume :
- 45
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Optimal Control - Applications & Methods
- Publication Type :
- Academic Journal
- Accession number :
- 178211191
- Full Text :
- https://doi.org/10.1002/oca.3112