P-SPARSLIB

Abstract

P-SPARSLIB is a portable library of sparse iterative solvers intended to be used in a distributed-memory environment. The library consists of the four major parts, the accelerators, preprocessing tools, preconditioning routines, and message-passing tools. The accelerators together with the preconditioners constitute the functional layer of the library. The accelerators are based on the Krylov subspace methods. These methods, whether for standard or distributed matrices, often work poorly without preconditioning. The preconditioners provided with the library encompass a number of `standard' options for preconditioning distributed sparse matrices, such as overlapping block Jacobi (overlapping additive Schwarz), multicolor block SOR (overlapping multicolor multiplicative Schwarz), distributed ILU(0), approximate inverse preconditioners, etc.

DateOfInformation

Fri Jun 12 13:53:35 1998

Domain

Numerical Programs and Routines!Linear algebra

Keyword

sparse linear systems

Name

P-SPARSLIB

TargetEnvironment

The package has been tested on the CM5, CRAY-T3D, CRAY T3E, Convex Exemplar, IBM SP2, IBM and SGI workstation clusters.

Version

2.21

Webpage

http://www.cs.umn.edu/Research/arpa/p_sparslib/psp-abs.html

ContactIs

Yousef Saad
Yousef Saad