Path: utzoo!attcan!uunet!know!zaphod.mps.ohio-state.edu!sdd.hp.com!ucsd!ogicse!emory!hubcap!frederic
From: frederic@degas.cs.unc.edu (Robin Fredericksen)
Newsgroups: comp.parallel
Subject: sparse matrix algorithms
Keywords: sparse, matrix, algorithms, needed
Message-ID: <10781@hubcap.clemson.edu>
Date: 4 Oct 90 17:40:25 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 13
Approved: parallel@hubcap.clemson.edu

Does anyone know of a sparse matrix (Gauss Elim., etc) algorithm for a SIMD
machine? (if possible, specifically for a Maspar MP1?)  I am interested in
references, actual code, or whatever I can get my hands on.  The matrices that
I am interested in are usually VERY sparse, and pretty close to tridiagonal.
(A set of ?loosely? coupled equations, but possibly {tens of?} thousands of
them...)  

Eric

-------------------------------------------------------------------------------
Eric Fredericksen	: Insert amazingly funny or enlightening quote
frederic@cs.unc.edu	: in this space here.
I don't need a disclaimer, I'm a graduate student so no one cares what I say...