Abstract
In a parallel linear system solution, an efficient usage of a multiprocessor system is usually achieved by implementing algorithms with high degree of parallelism and good convergence properties as well as by tuning parallel codes to a particular system. Among the software tools that facilitate this development is PSPARSLIB, a suite of codes for solving sparse linear systems of equations. PSPARSLIB takes a modular approach to constructing a solution method and has logic-transparent computational kernels that can be adapted to the problem at hand. Here, we outline a few parallel solution methods incorporated recently in PSPARSLIB. We give a rationale for implementing these techniques and present several numerical experiments.
This work was supported in part by NSF under grant CCR-9618827 and in part by the Minnesota Supercomputer Institute.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chan T. F., Goovaerts D.: On the relationship between overlapping and nonoverlapping domain decomposition methods. SIAM J. on Matrix Analysis and Applications 13 (1992) 663–670
Gropp W, Lusk E, Skjellum A: Using MPI: Portable Parallel Programming with the Message Passing Interface. MIT Press, Boston (1994)
Karypis G. Graph Partitioning and its Applications to Scientific Computing. PhD thesis. Department of Computer Science, University of Minnesota, Minneapolis, MN (1996)
Lo G.-C., Saad Y.: Iterative solution of general sparse linear systems on clusters of workstations. Technical Report UMSI 96/117 & UM-IBM 96/24, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN (1996)
Ma S., Saad Y.: Distributed ILU(0) and SOR preconditioners for unstructured sparse linear systems. Technical Report 94-027, Army High Performance Computing Research Center, University of Minnesota, Minneapolis, MN (1994)
Saad Y.: SPARSKIT: A basic tool kit for sparse matrix computations. Technical Report 90-20, Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffet Field, CA (1990)
Saad Y.: ILUM: a parallel multi-elimination ILU preconditioner for general sparse matrices. SIAM J. on Scientific Computing. 17 (1996) 830–847
Saad Y.: Iterative Methods for Sparse Linear Systems. PWS publishing, New York (1996)
Saad Y., Sosonkina M.: Distributed Schur Complement Techniques for General Sparse Linear Systems. Technical Report UMSI 97/159, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN (1997)
Saad Y., Zhang J.: BILUM: Block Versions of Multi-Elimination and Multi-Level ILU Preconditioner for General Sparse Linear Systems. Technical Report UMSI 97/126 Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN (1997)
Smith B., Bjørstad P., Gropp W.: Domain decomposition: Parallel multilevel methods for elliptic partial differential equations. Cambridge University Press, New York (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saad, Y., Sosonkina, M. (1998). Solution of distributed sparse linear systems using PSPARSLIB. In: Kågström, B., Dongarra, J., Elmroth, E., Waśniewski, J. (eds) Applied Parallel Computing Large Scale Scientific and Industrial Problems. PARA 1998. Lecture Notes in Computer Science, vol 1541. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095374
Download citation
DOI: https://doi.org/10.1007/BFb0095374
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65414-8
Online ISBN: 978-3-540-49261-0
eBook Packages: Springer Book Archive