Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!emory!hubcap!argosy!weeks
From: argosy!weeks@decwrl.dec.com (Dennis Weeks)
Newsgroups: comp.parallel
Subject: Re: sparse matrix algorithms
Summary: Here are a couple of references you may find useful
	 (they are pre-MasPar, alas!)
Keywords: sparse, matrix, algorithms, needed
Message-ID: <10801@hubcap.clemson.edu>
Date: 5 Oct 90 20:22:12 GMT
References: <10781@hubcap.clemson.edu>
Sender: fpst@hubcap.clemson.edu
Lines: 17
Approved: parallel@hubcap.clemson.edu

John R. Gilbert and Hjalmtyr Hafsteinsson,
	"Parallel Solution of Sparse Linear Systems"
	SWAT 88 Proceedings (1st Scandinavian Workshop on Algorithm Theory,
	Halmstad, Sweden, July 5-8 1988), published as Springer-Verlag's
	'Lecture Notes in Computer Science' #318 (pp. 145-153)

H. S. Stone,
	"An Efficient Parallel Algorithm for the Solution of a
	Tridiagonal Linear System of Equations"
	Journal of the ACM, 20 (1973) p. 27-??.

There is a more general piece by Peter Kogge (he was a student of Harold
Stone at Stanford) which has an algorithmic approach that includes
tridiagonal solvers as a specific case:
P. Kogge,
	"Parallel Solution of Recurrence Problems"
	IBM Journal of Research and Development, 1974, pp. 368-??