Path: utzoo!attcan!uunet!ns-mx!iowasp!ceres.physics.uiowa.edu!zaphod.mps.ohio-state.edu!swrinde!emory!hubcap!zyu
From: zyu@caip.rutgers.edu (Zhixin Yu  )
Newsgroups: comp.parallel
Subject: Looking for best direct or semi-direct sparse matrix solvers.
Keywords: Help needed on parallel linear system solvers.
Message-ID: <9221@hubcap.clemson.edu>
Date: 6 Jun 90 12:26:48 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 12
Approved: parallel@hubcap.clemson.edu

I'm looking for general sparse matrix (or linear system) solvers on parallel
machines (mainly distributed-memory type).  Can any one out there point me 
out the most efficient algorithms in the recent development of this area?
I'm interested in both of direct and semi-direct (like PCG) methods and my
matrix is large and diagonal-dominant, but not positive definite (not
symmetric either).

Thanks a lot.

--Sam

zyu@caip.rutgers.edu