Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
Two accelerated gradient-based iteration methods for solving the Sylvester matrix equation AX + XB = C. |
| Συγγραφείς: |
Wang, Huiling, Wu, Nian-Ci, Nie, Yufeng |
| Πηγή: |
AIMS Mathematics; 2024, Vol. 9 Issue 12, p1-19, 19p |
| Θεματικοί όροι: |
Sylvester matrix equations, Algorithms |
| Περίληψη: |
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 A X + X B = 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of AIMS Mathematics is the property of American Institute of Mathematical Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Complementary Index |