Skip to main content
SpringerLink
Log in

pARMS: A Package for Solving General Sparse Linear Systems on Parallel Computers

  • Conference paper
  • First Online:
Book cover Parallel Processing and Applied Mathematics (PPAM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2328))

Abstract

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.

Work supported by NSF/ACI-0000443, NSF/INT-0003274, and by the Minnesota Supercomputer Institute

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  8. G. Radicati di Brozolo and Y. Robert. Parallel conjugate gradient-like algorithms for solving sparse non-symmetric systems on a vector multiprocessor. Parallel Computing, 11:223–239, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  9. Y. Saad. A flexible inner-outer preconditioned GMRES algorithm. SIAM J. on Sci. and Stat. Comput., 14:461–469, 1993.

    Article  MathSciNet  MATH  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 

  11. Y. Saad. Iterative Methods for Sparse Linear Systems. PWS publishing, New York, 1996.

    MATH  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 

  13. Y. Saad and M. Sosonkina. Distributed schur complement techniques for general sparse linear systems. J. Scientific Computing, 21(4):1337–1356, 1999.

    Article  MathSciNet  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 

Download references

Author information

Authors and Affiliations

  1. University of Minnesota, Minneapolis, MN, 55455, USA

    Y. Saad

  2. University of Minnesota, Duluth, MN, 55812, USA

    M. Sosonkina

Authors
  1. Y. Saad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Sosonkina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saad, Y., Sosonkina, M. (2002). pARMS: A Package for Solving General Sparse Linear Systems on Parallel Computers. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation