jlu@mcs213k.cs.umr.edu (Jui-lin Lu) (03/28/91)
Greeting *:
I'm working on my term project -- using iterative and direct methods to
solve ax=b type problem in the hypercube. After spending the past two days
in the library with little info, I decided to post it here to hopefully
get help. Any points (papers, tech. reports., etc.) will be appreciated.
Of course, any architecture is welcomed although the hypercube is preferred.
You can either post or e-mail me at jlu@cs.umr.edu. If there are sufficient
interests, I'll summarize it. Thanx in advance!
--
***************************************--- student ---*
* Obviousness is always the enemy of * \ Eric J. Lu / *
* correctness. -- Bertrand Russell * / jlu@cs.umr.edu \ *
***************************************--- Univ. of Missouri-Rolla ---*
--
=========================== MODERATOR ==============================
Steve Stevenson {steve,fpst}@hubcap.clemson.edu
Department of Computer Science, comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabellftower@ncar.ucar.EDU (Francis Tower) (03/30/91)
Eric,
How nice is your A matrix? is it a tri-diagional or a matrix where
Gaussian elimination might be used.
One ref is "Parallel Algorithms & Matrix Computation" Jagdish Modi,
Clarendon Press, 1988.
For my term project, I'm working on tridiagonal solvers running on
a CM2 and an 8-cpu Cray Y-MP.
Frank Tower
--
=========================== MODERATOR ==============================
Steve Stevenson {steve,fpst}@hubcap.clemson.edu
Department of Computer Science, comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell