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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dumas, J.G., Gautier, T., Giesbrecht, M., Giorgi, P., Hovinen, B., Kaltofen, E., Saunders, B.D., Turner, W.J., Villard, G.: LinBox: A Generic Library for Exact Linear Algebra. In: Cohen, A., Gao, X.S., Takayama, N. (eds.) Mathematical Software: ICMS 2002, Proceedings of the First International Congress of Mathematical Software, pp. 40–50. World Scientific (2002)
Dumas, J.G.: The Sparse Integer Matrices Collection, http://ljk.imag.fr/membres/Jean-Guillaume.Dumas/simc.html
Dumas, J.G., Villard, G.: Computing the rank of large sparse matrices over finite fields. In: CASC 2002 Computer Algebra in Scientific Computing, pp. 22–27. Springer, Heidelberg (2002)
Golub, G., Van Loan, C.: Matrix Computation, 2nd edn. Johns Hopkins University Press (1989)
Grigori, L., Demmel, J.W., Li, X.S.: Parallel symbolic factorization for sparse LU with static pivoting. SIAM J. Scientific Computing 29(3), 1289–1314 (2007)
LinBox website, http://linalg.org/
Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33, 103–111 (1990), http://doi.acm.org/10.1145/79173.79181
Vetter, J., Chambreau, C.: mpiP: Lightweight, Scalable MPI profiling (2004), http://www.llnl.gov/CASC/mpiP
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murri, R. (2012). A Novel Parallel Algorithm for Gaussian Elimination of Sparse Unsymmetric Matrices. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2011. Lecture Notes in Computer Science, vol 7203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31464-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-31464-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31463-6
Online ISBN: 978-3-642-31464-3
eBook Packages: Computer ScienceComputer Science (R0)