The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
Summary: In this paper, we present two different relaxed gradient based iterative (RGI) algorithms for solving the symmetric and skew symmetric solution of the Sylvester matrix equation \(A X + X B = C\). By using these two iterative methods, it is proved that the iterative solution converges to its true symmetric (skew symmetric) solution under some appropriate assumptions when any initial symmetric (skew symmetric) matrix \(X_0\) is taken. Finally, two numerical examples are given to illustrate that the introduced iterative algorithms are more efficient.
scientific article; zbMATH DE number 6971776
scientific article