Parms: A package for solving general sparse linear systems on parallel computers

Yousef Saad, M. Sosonkina

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

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 frameworkof “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 complementtype 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.

Original languageEnglish (US)
Title of host publicationParallel Processing and Applied Mathematics - 4th International Conference, PPAM 2001, Revised Papers
EditorsRoman Wyrzykowski, Jack Dongarra, Marcin Paprzycki, Jerzy Wasniewski
PublisherSpringer Verlag
Pages446-457
Number of pages12
ISBN (Print)9783540437925
DOIs
StatePublished - 2002
Event4th International Conference on Parallel Processing and Applied Mathematics, PPAM 2001 - Naleczow, Poland
Duration: Sep 9 2001Sep 12 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2328
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Conference on Parallel Processing and Applied Mathematics, PPAM 2001
Country/TerritoryPoland
CityNaleczow
Period9/9/019/12/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Fingerprint

Dive into the research topics of 'Parms: A package for solving general sparse linear systems on parallel computers'. Together they form a unique fingerprint.

Cite this