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. © 2012 Springer-Verlag.
CITATION STYLE
Murri, R. (2012). A novel parallel algorithm for Gaussian elimination of sparse unsymmetric matrices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7203 LNCS, pp. 183–193). https://doi.org/10.1007/978-3-642-31464-3_19
Mendeley helps you to discover research relevant for your work.