Abstract
In this paper, we propose the parallel multisplitting PSD method, for solving large nonsingular system of linear equations Ax = b. The convergence theorems of these new algorithms are established under the condition that the coefficient matrix A of linear system is an H-matrix. Some results also yield new covergence theorem for PSD method. Finally, a numerical example is given to show the superiority of the new algorithm.
Sign-in/Register to access full text options 
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.
