A novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices
Mathematical Software
2012-01-17 v3 Distributed, Parallel, and Cluster Computing
Numerical Analysis
Numerical Analysis
Abstract
We describe a new algorithm for Gaussian Elimination suitable for general (unsymmetric and possibly singular) sparse matrices, of any entry type, which has a natural parallel and distributed-memory formulation but degrades gracefully to sequential execution. We present a sample MPI implementation of a program computing the rank of a sparse integer matrix using the proposed algorithm. Some preliminary performance measurements are presented and discussed, and the performance of the algorithm is compared to corresponding state-of-the-art algorithms for floating-point and integer matrices.
Cite
@article{arxiv.1105.4136,
title = {A novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices},
author = {Riccardo Murri},
journal= {arXiv preprint arXiv:1105.4136},
year = {2012}
}
Comments
14 pages; 2 PDF figures; LaTeX2e; final version submitted for the PPAM2011 conference proceedings