Modified and accelerated relaxed gradient-based iterative algorithms for the complex conjugate and transpose matrix equations

In this paper, by applying the updated technique to the relaxed gradient-based iterative algorithm proposed by Wang et al. (J. Appl. Math. Comput. 67 , 317–341 2021 ), we develop the modified relaxed gradient-based iterative algorithm for the complex conjugate and transpose Sylvester matrix equation...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Numerical algorithms Ročník 97; číslo 4; s. 1955 - 2009
Hlavní autoři: Huang, Zhengge, Cui, Jingjing
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.12.2024
Springer Nature B.V
Témata:
Algebra
Algorithms
Computational mathematics
Computer Science
Conjugates
Convergence
Iterative algorithms
Iterative methods
Linear systems
Methods
Numeric Computing
Numerical Analysis
Original Paper
System theory
Theory of Computation
Modified relaxed gradient-based iterative algorithm
Optimal convergence factor
Complex conjugate and transpose matrix equation
65F10
Real representation
Accelerated relaxed gradient-based iterative algorithm
Convergence
ISSN:1017-1398, 1572-9265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, by applying the updated technique to the relaxed gradient-based iterative algorithm proposed by Wang et al. (J. Appl. Math. Comput. 67 , 317–341 2021 ), we develop the modified relaxed gradient-based iterative algorithm for the complex conjugate and transpose Sylvester matrix equations. Compared with the relaxed gradient-based iterative algorithm, the modified relaxed gradient-based iterative algorithm can make full use of the latest information to compute the next result and lead to a faster convergence rate. Furthermore, in order to reduce the computation cost of each iteration of the relaxed gradient-based iterative algorithm, by replacing the coefficient matrices by their diagonal parts, we construct the accelerated relaxed gradient-based iterative algorithm. By utilizing the properties of the real representation of a complex matrix, matrix norms, and techniques of inequalities, we prove that two proposed iterative algorithms are convergent under proper restrictions. And the quasi-optimal convergence factor of the accelerated relaxed gradient-based iterative algorithm is also derived. Also, some numerical examples are given to show the effectiveness and the superiorities of the proposed algorithms. Lastly, the application in time-varying linear system of the proposed algorithms is presented.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
DOI:10.1007/s11075-024-01775-2