Abstract

This paper proposes the modified generalization of the HSS to solve a large and sparse continuous Sylvester equation, improving the efficiency and robustness. The analysis shows that the MGHSS converges to the unique solution of AX + XB = C unconditionally. We also propose an inexact variant of the MGHSS and prove its convergence under certain conditions. Numerical experiments verify the efficiency of the proposed methods.