A novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices

Details A novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices A novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices

2011-05-20

arxiv.org/abs/1105.4136v3

Computer Science

Mathematical Software

14 pages; 2 PDF figures; LaTeX2e; final version submitted for the PPAM2011 conference proceedings

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-650293