Global conjugate gradient method for solving large general Sylvester matrix equation
Saeed Karimi · Journal of mathematical modeling · 2013
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-hand sides. By defining a linear matrix operator and imposing some conditions on this operator, we demonstrate how to employ the GL-CG algorithm for solving large general Sylvester matrix equation. Finally, some numerical experi- ments are given to illustrate the efficiency of the method.