zyu@caip.rutgers.edu (Zhixin Yu ) (06/06/90)
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