Algorithms for sparse Gaussian elimination with partial pivoting

We compare several algorithms for sparse Gaussian elimination with column interchanges. The algorithms are all derived from the same basic elinunatmn scheme, and they (hffer mainly m lmplementatmn details. We examine their theoretmal behavior and compare thetr performances on a number of test problems with that of a high quality complete threshold pwotmg code. Our conclusion is that partial pivoting codes perform qmte well and that they should be considered for sparse problems whenever pivoting for numerical stability is reqmred.