Search

In this paper, we introduce a modernized and improved version of the Davison-Man method for the numerical resolution of Sylvester matrix equations. In the case of moderate size problems, we give some background facts about this iterative method, addressing the problem of stagnation and we propose an iterative refinement technique to improve its accuracy. Although not designed to solve large-scale Sylvester equations, we propose an approach combining the extended block Krylov algorithm and the Davison-Man method which gives interesting results in terms of accuracy and shows to be competitive with the classical Krylov subspaces methods. Numerical examples are given to illustrate the efficiency of this approach. [ABSTRACT FROM AUTHOR]

In this paper, a modified conjugate gradient iterative method for solving Sylvester equation is presented. By using this iterative method, the least squares anti-bisymmetric solution and the optimal approximation solution can be obtained. Here we present the derivation and theoretical analysis of our iterative method. Numerical results illustrate the feasibility and effectiveness of the proposed iterative method. [ABSTRACT FROM AUTHOR]

In order to solve the Sylvester equations more efficiently, a new four parameters positive and skew-Hermitian splitting (FPPSS) iterative method is proposed in this paper based on the previous research of the positive and skew-Hermitian splitting (PSS) iterative method. We prove that when coefficient matrix A and B satisfy certain conditions, the FPPSS iterative method is convergent in the parameter's value region. The numerical experiment results show that compared with previous iterative method, the FPPSS iterative method is more effective in terms of iteration number IT and runtime. [ABSTRACT FROM AUTHOR]