Solving Linear Systems with Sparse Matrices on Hypercubes
Mo Mu, John R. Rice · Purdue e-Pubs (Purdue University System) · 1989
We investigate parallel Gauss elimination for sparse matrices, especially those arising from the discretization of PDEs. We propose an approach which combines minimum degree ordering, nested dissection, domain decomposition and multifront techniques. Neither symbolic factorization nor explicit representation of elimination trees are needed. An effective and economic dynamic data structure is presented along with a grid based subtree~subcube assignment strategy which enhances load balancing, high parallelism and low communication cost The algorithm is implemented on the NCUBE/7 .. Work supported in part by National Science FoundaLion granl CCR·8619817• ... Work supponed in part by the Air Force Office of Scientific Research grants 84-0385. 88-0-43.