Skip to main content
SpringerLink
Log in

A Novel Parallel Algorithm for Gaussian Elimination of Sparse Unsymmetric Matrices

  • Conference paper
Book cover Parallel Processing and Applied Mathematics (PPAM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7203))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Google Scholar 

  2. Dumas, J.G.: The Sparse Integer Matrices Collection, http://ljk.imag.fr/membres/Jean-Guillaume.Dumas/simc.html

  3. 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)

    Google Scholar 

  4. Golub, G., Van Loan, C.: Matrix Computation, 2nd edn. Johns Hopkins University Press (1989)

    Google Scholar 

  5. 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)

    Article  MathSciNet  MATH  Google Scholar 

  6. LinBox website, http://linalg.org/

  7. Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33, 103–111 (1990), http://doi.acm.org/10.1145/79173.79181

    Article  Google Scholar 

  8. Vetter, J., Chambreau, C.: mpiP: Lightweight, Scalable MPI profiling (2004), http://www.llnl.gov/CASC/mpiP

Download references

Author information

Authors and Affiliations

  1. Grid Computing Competence Centre, Organisch-Chemisch Institut, University of Zürich, Winterthurerstrasse 190, CH-8006, Zürich, Switzerland

    Riccardo Murri

Authors
  1. Riccardo Murri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer and Information Science, Czestochowa University of Technology, Dabrowskiego 69, 42-201, Czestochowa, Poland

    Roman Wyrzykowski  & Konrad Karczewski  & 

  2. Electrical Engineering and Computer Science Department, University of Tennessee, 1122 Volunteer Blvd, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

  3. Department of Informatics and Mathematical Modeling, Technical University of Denmark, Richard Petersens Plads, Building 321, 2800, Kongens Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation