Newsgroups: sci.math.num-analysis,comp.parallel,comp.parallel.mpi,comp.parallel.pvm
From: rro%PROBLEM_WITH_INEWS_GATEWAY_FILE@uunet.uu.net (Rod Oldehoeft)
Subject: Re: Parallel sparse matrix multiplication
Organization: U.S. Department of Energy
Date: Thu, 30 Nov 1995 14:03:06 GMT
Message-ID: <49kdiq$1ei@ra.nrl.navy.mil>

Petter Kolm (kolm@num01.nada.kth.se) wrote:

> Hi

> I am looking for references about sparse matrix multiplication on
> parallel computers. Especially, I am interested in data distribution
> and layout patterns for general sparse matrices.

> --Petter

I have here "Aztec User's Guide, Version 1.0," Sandia National
Laboratories Report SAND95-1559, by Scott A. Hutchinson, John N.
Shadid, and Ray S. Tuminaro.

>From the abstract:  "Aztec is an iterative library that greatly
simplifies the parallelization process when solving the linear
systems of equations Ax = b where A is a user supplied n x n sparse
matrix, b is a user supplied vector of length n and x is a vector of
length n to be computed."

Of course there is a parallelized sparse matrix-vector product in the
heart of Aztec, which is what you asked about.  Visit the Aztec web
page at http://www.cs.sandia.gov/HPCCIT/aztec.html.



