On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations

We present a circulant and skew-circulant splitting (CSCS) iterative method for solving large sparse continuous Sylvester equations AX + XB = C, where the coefficient matrices A and B are Toeplitz matrices. A theoretical study shows that if the circulant and skew-circulant splitting factors of A and B are positive semi-definite (not necessarily Hermitian), and at least one factor is positive definite, then the CSCS method converges to the unique solution of the Sylvester equation. In addition, our analysis gives an upper bound for the convergence factor of the CSCS iteration which depends only on the eigenvalues of the circulant and skew-circulant splitting matrices. A computational comparison with alternative methods reveals the efficiency and reliability of the proposed method.

Automated summary

In this article, we propose an iterative method for solving large sparse continuous Sylvester equations. Theoretical analysis shows the convergence and upper bound of the proposed method. Computational comparison with alternative methods demonstrates its efficiency and reliability.