Parallel sparse Gaussian elimination with partial pivoting

In this article, the authors consider the factorization of a sparse nonsymmetric matrix using Gaussian elimination with partial pivoting on a multiprocessor having a globally-shared memory. The parallel algorithm makes use of a static data structure developed by George, Liu and Ng. Some numerical experiments on a Sequent Balance 8000 are presented to demonstrate the efficiency of the parallel implementation.