Two accelerated gradient-based iteration methods for solving the Sylvester matrix equation AX + XB = C
AIMS Mathematics · 2024 · 9 (12) · 34734-34752
DOI: 10.3934/math.20241654 ↗Kurz gefasst
Fachartikel in der Zeitschrift AIMS Mathematics, 2024. Verfasst von Huiling Wang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 29 Literaturangaben.
Abstract (Originalsprache)
In this paper, combining the precondition technique and momentum item with the gradient-based iteration algorithm, two accelerated iteration algorithms are presented for solving the Sylvester matrix equation $ AX+XB = C $. Sufficient conditions to guarantee the convergence properties of the proposed algorithms are analyzed in detail. Varying the parameters of these algorithms in each iteration, the corresponding adaptive iteration algorithms are also provided, and the adaptive parameters can be explicitly obtained by the minimum residual technique. Several numerical examples are implemented to illustrate the effectiveness of the proposed algorithms.
Zitieren
APA
Wang, H., Wu, N., & Nie, Y. (2024). Two accelerated gradient-based iteration methods for solving the Sylvester matrix equation AX + XB = C. AIMS Mathematics, 9(12), 34734-34752. https://doi.org/10.3934/math.20241654
Vancouver
Wang H, Wu N, Nie Y. Two accelerated gradient-based iteration methods for solving the Sylvester matrix equation AX + XB = C. AIMS Mathematics. 2024;9(12):34734-34752. doi:10.3934/math.20241654
BibTeX
@article{Wang2024,
author = {Wang, Huiling and Wu, Nian-Ci and Nie, Yufeng},
title = {Two accelerated gradient-based iteration methods for solving the Sylvester matrix equation AX + XB = C},
journal = {AIMS Mathematics},
year = {2024},
volume = {9},
number = {12},
pages = {34734--34752},
doi = {10.3934/math.20241654}
}
EUVIMED