A shift‐splitting Jacobi‐gradient iterative algorithm for solving the matrix equation A𝒱−𝒱‾B=C

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimal control applications & methods Jg. 45; H. 4; S. 1593 - 1602
1. Verfasser: Bayoumi, Ahmed M. E.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hoboken, USA John Wiley & Sons, Inc 01.07.2024
Schlagworte:
ISSN:0143-2087, 1099-1514
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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. In this paper, a novel algorithm called the shift‐splitting Jacobi‐gradient iterative (SSJGI) algorithm is introduced to enhance the convergence of the gradient iterative (GI) algorithm and the Jacobi‐gradient iterative (JGI) algorithm. This algorithm is based on the splitting of the coefficient matrices.
ISSN:0143-2087
1099-1514
DOI:10.1002/oca.3112