pARMS: A Package for Solving General Sparse Linear Systems on Parallel Computers
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solution of linear systems arising from realistic scientific and engineering applications. The most common parallel preconditioners used for sparse linear systems adapt domain decomposition concepts to the more general framework of “distributed sparse linear systems”. The parallel Algebraic Recursive Multilevel Solver (pARMS) is a recently developed package which integrates together variants from both Schwarz procedures and Schur complement-type techniques. This paper discusses a few of the main ideas and design issues of the package. A few details on the implementation of pARMS are provided.
KeywordsMessage Passing Interface Local Equation Sparse Linear System Local Matrix Interface Point
Unable to display preview. Download preview PDF.
- 1.S. Balay, W. D. Gropp, L. Curfman McInnes, and B. F. Smith. PETSc 2.0 users manual. Technical Report ANL-95/11-Revision 2.0.24, Argonne National Laboratory, 1999.Google Scholar
- 2.V. Eijkhout and T. Chan. ParPre a parallel preconditioners package, reference manual for version 2.0.17. Technical Report CAM Report 97-24, UCLA, 1997.Google Scholar
- 3.W. Gropp, E. Lusk, and A. Skjellum. Using MPI: Portable Parallel Programming with the Message Passing Interface. MIT press, 1994.Google Scholar
- 4.Scott A. Hutchinson, John N. Shadid, and R. S. Tuminaro. Aztec user’s guide. version 1.0. Technical Report SAND95-1559, Sandia National Laboratories, Albuquerque, NM, 1995.Google Scholar
- 5.D. Hysom and A. Pothen. A scalable parallel algorithm for incomplete factor preconditioning. Technical Report (preprint), Old-Dominion University, Norfolk, VA, 2000.Google Scholar
- 6.M. T. Jones and P. E. Plassmann. BlockSolve95 users manual: Scalable library software for the solution of sparse linear systems. Technical Report ANL-95/48, Argonne National Lab., Argonne, IL., 1995.Google Scholar
- 7.Z. Li, Y. Saad, and M. Sosonkina. pARMS: a parallel version of the algebraic recursive multilevel solver. Technical Report umsi-2001-100, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN, 2001.Google Scholar
- 10.Y. Saad. Krylov subspace methods in distributed computing environments. In M. Hafez, editor, State of the Art in CFD, pages 741–755, 1995.Google Scholar
- 12.Y. Saad and A. Malevsky. PSPARSLIB: A portable library of distributed memory sparse iterative solvers. In V. E. Malyshkin et al., editor, Proceedings of Parallel Computing Technologies (PaCT-95), 3-rd international conference, St. Petersburg, Russia, Sept. 1995, 1995.Google Scholar
- 14.Y. Saad and B. Suchomel. ARMS: An algebraic recursive multilevel solver for general sparse linear systems. Technical Report umsi-99-107-REVIS, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN, 2001. Revised version of umsi-99-107.Google Scholar
- 15.Y. Saad and K. Wu. Parallel sparse matrix library (P_SPARSLIB): The iterative solvers module. Technical Report 94-008, Army High Performance Computing Research Center, Minneapolis, MN, 1994.Google Scholar
- 16.Y. Saad and K. Wu. Design of an iterative solution module for a parallel sparse matrix library (P_SPARSLIB). In W. Schonauer, editor, Proceedings of IMACS conference, Georgia, 1994, 1995.Google Scholar