Abstract
In this paper we are concerned with the implementation on distributed memory MIMD computers of parallel block preconditionings for solving large and sparse symmetric positive definite linear systems. For this purpose, a recently proposed ordering strategy is used. Experimental tests performed on a transputer-based multiprocessor computer are reported, displaying that good performance can be achieved in exchange for some optimization effort and on to the assumption that the number of processors is smaller by orders of magnitude than the size of the problem to solve, which agrees with observations made elsewhere.
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.
