The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection methods onto matrix Krylov subspaces. Numerical examples are presented.
Kaabi, A. (2014). On the numerical solution of generalized Sylvester matrix equations. Bulletin of the Iranian Mathematical Society, 40(1), 101-113.
MLA
Kaabi, A. "On the numerical solution of generalized Sylvester matrix equations", Bulletin of the Iranian Mathematical Society, 40, 1, 2014, 101-113.
HARVARD
Kaabi A. (2014). 'On the numerical solution of generalized Sylvester matrix equations', Bulletin of the Iranian Mathematical Society, 40(1), pp. 101-113.
CHICAGO
A. Kaabi, "On the numerical solution of generalized Sylvester matrix equations," Bulletin of the Iranian Mathematical Society, 40 1 (2014): 101-113,
VANCOUVER
Kaabi A. On the numerical solution of generalized Sylvester matrix equations. BIMS. 2014;40(1):101-113.
