WSSMP: Watson Symmetric Sparse Matrix Package: Users Manual: Version 2.3

WSSMP: Watson Symmetric Sparse Matrix Package (Version 2.3)

by Anshul Gupta (
Mahesh Joshi
Vipin Kumar

IBM Research Report RC 20923, July 17, 1997

The Watson Symmetric Sparse Matrix Package, WSSMP, is a robust high
performance software package for solving large sparse symmetric positive
definite systems of linear equations on the IBM RS6000 work-stations and
IBM Scalable Parallel (SP) systems. It uses a modified version of the
multifrontal algorithm for sparse Cholesky factorization and a highly
scalable parallel sparse Cholesky factorization algorithm.
The package also uses scalable parallel sparse triangular solvers
and a parallel version of a previously released package, WGPP, for
computing fill-reducing orderings. The current release of WSSMP can
perform any or all of the following tasks: ordering, symbolic
factorization, Cholesky factorization, triangular solves, and iterative
refinement. An SMP version will be released in the future. A later
version is also expected to perform LDL^T factorization, in addition to LL^T
factorization, which is the only factorization option in the current version.
The functionality and the calling sequences of the serial and the parallel
versions are almost the same.

By: Anshul Gupta, Mahesh Joshi and Vipin Kumar

Published in: RC20923 in 1997


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

Questions about this service can be mailed to .