A novel parallel algorithm for gaussian elimination of sparse unsymmetric matrices

Authors:
Riccardo Murri
Affiliations:
Grid Computing Competence Centre, Organisch-Chemisch Institut, University of Zürich, Zürich, Switzerland
Venue:
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Year:
2011

Citing 2
Cited 0

A bridging model for parallel computation

Communications of the ACM
Parallel Symbolic Factorization for Sparse LU with Static Pivoting

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

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.