Abstract
We first study convergence of both the relaxed multisplitting method and the relaxed (nonstationary) two-stage multisplitting method using incomplete factorizations for solving a linear system whose coefficient matrix is a large sparse symmetric positive definite matrix. We next study a parallel implementation of the relaxed two-stage multisplitting method using incomplete factorizations as inner splittings and an application of the relaxed two-stage multisplitting method to parallel preconditioner of the CG (conjugate gradient) method. Lastly, we provide parallel performance results of both the relaxed two-stage multisplitting method and the CG method with a parallel preconditioner which is derived from the relaxed two-stage multisplitting method on the IBM p690 supercomputer.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
