Abstract
We discuss several algorithms for the solution of sparse linear systems on parallel architectures. We will be concerned primarily with shared memory machines and will consider both direct and iterative methods of solution. The direct methods are based on Gaussian elimination and exploit parallelism coming from both the sparsity and from a full matrix kernel. The iterative method is a block projection method using a direct solver within the blocks. We then discuss the development of two codes, one for the solution of general sparse equations, the other for sparse symmetric indefinite systems. Some results on vector multiprocessor supercomputers are presented to illustrate the behaviour of our approaches.
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.
