Two accelerated gradient-based iteration methods for solving the Sylvester matrix equation AX + XB = C
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2024-12-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20241654 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|