Abstract
A nested splitting conjugate gradient (NSCG) iterative method and a preconditioned NSCG (PNSCG) iterative method are presented for solving the generalized Sylvester equation with large sparse coefficient matrices, respectively. Both methods are actually inner/outer iterations, which employ the CG-like method as inner iteration to approximate each outer iteration, while each outer iteration is induced by a convergent and symmetric positive definite splitting of the coefficient matrices. Convergence conditions of both methods are studied in depth and numerical experiments demonstrate the efficiency of the proposed methods. Moreover, experimental results show that the PNSCG method is more accurate, robust and effective than the NSCG method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.