Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!sol.ctr.columbia.edu!emory!hubcap!booker%network From: booker%network@ucsd.edu (Booker bense) Newsgroups: comp.parallel Subject: Parallel Implementations of Iterative Methods Keywords: mimd,matrix solution,survey Message-ID: <12077@hubcap.clemson.edu> Date: 5 Dec 90 13:22:56 GMT Sender: fpst@hubcap.clemson.edu Followup-To: comp.parallel Organization: San Diego Supercomputer Center @ UCSD Lines: 16 Approved: parallel@hubcap.clemson.edu Howdy, I am interested in recent literature on methods for implementing iterative solvers for sparse Ax = b on MIMD architectures, particularly on hypercube architectures. Any references to automated red-black ordering for sparse matrices would also be of interest. In my brief survey of the problem, this seems to be the hard part. Given a red-black partion it seems to be straightforward to map the problem onto a ring which can then be mapped onto hypercube in a straight forward manner. I will summarize to the net if there is sufficent interest. - Booker C. Bense /* benseb@grumpy.sdsc.edu */ Brought to you by Super Global Mega Corp .com