Abstract So far, our focus has been on the theoretical and algorithmic principles involved in sparse Gaussian elimination-based factorizations. To limit storage work computation of factors their use during solve phase it is generally necessary to reorder (permute) matrix before factorization commences. The complexity most critical steps highly dependent amount fill-in, as can be seen from follo...