This paper presents a new version of the successive approximations method for solving Sylvester equations AX − XB = C, where A and B are symmetric negative and positive definite matrices, respectively. This method is based ...

This paper presents preconditioned Galerkin and minimal residual algorithms for the solution of Sylvester equations AX−XB=C. Given two good preconditioner matrices M and N for matrices A and B, respectively, we solve the ...