A new version of successive approximations method for solving Sylvester matrix equations

摘要

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 on the block GMRES-Sylvester method. We also discuss the convergence of the new method. Some numerical experiments for obtaining the numerical solution of Sylvester equations are given. Numerical experiments show that the solution of Sylvester equations can be obtained with high accuracy and the new algorithm is a robust technique for solving Sylvester equations.