A Shared- and distributed-memory parallel general sparse direct solver (original) (raw)

Abstract

An important recent development in the area of solution of general sparse systems of linear equations has been the introduction of new algorithms that allow complete decoupling of symbolic and numerical phases of sparse Gaussian elimination with partial pivoting. This enables efficient solution of a series of sparse systems with the same nonzero pattern but different coefficient values, which is a fairly common situation in practical applications. This paper reports on a shared- and distributed-memory parallel general sparse solver based on these new symbolic and unsymmetric-pattern multifrontal algorithms.

Access this article

Log in via an institution

Subscribe and save

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Amestoy P.R., Duff I.S., Koster J., L’Excellent J.Y. (2001). A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23(1): 15–41
    Article MATH Google Scholar
  2. Amestoy P.R., Duff I.S., L’Excellent J.Y. (2000). Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng. 184: 501–520
    Article MATH Google Scholar
  3. Davis T.A., Duff I.S. (1997). An unsymmetric-pattern multifrontal method for sparse LU factorization. SIAM J. Matrix Anal. Appl. 18(1): 140–158
    Article MATH Google Scholar
  4. Duff I.S., Reid J.K. (1984). The multifrontal solution of unsymmetric sets of linear equations. SIAM J. Sci. Stat. Comput. 5(3): 633–641
    Article MATH Google Scholar
  5. Gupta, A.: a high-performance GEPP-based sparse solver. In: Proceedings of PARCO (2001). http://www.cs.umn.edu/ãgupta/doc/parco-01.ps
  6. Gupta A. (2002). Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices. SIAM J. Matrix Anal. Appl. 24(2): 529–552
    Article MATH Google Scholar
  7. Gupta, A.: WSMP: Watson sparse matrix package (Part-II: direct solution of general sparse systems). In: Technical report RC 21888 (98472), IBM T.J. Watson Research Center, Yorktown Heights, NY (20 November 2000). http://www.cs.umn.edu/ãgupta/wsmp
  8. Gupta A. (2002) Recent advances in direct methods for solving unsymmetric sparse systems of linear equations. ACM Trans Math. Softw. 28(3): 301–324
    Article MATH Google Scholar
  9. Gupta A., Karypis G., Kumar V. (1997) Highly scalable parallel algorithms for sparse matrix factorization. IEEE Trans. Parallel Distrib. Syst. 8(5): 502–520
    Article Google Scholar
  10. Hadfield, S.M.: On the LU factorization of sequences of identically structured sparse matrices within a distributed memory environment. Ph.D. Thesis, University of Florida, Gainsville, FL (1994)
  11. Li X.S., Demmel J.W. (2003) SuperLU_DIST: a scalable distributed-memory sparse direct solver for unsymmetric linear systems. ACM Trans. Math. Softw. 29(2): 110–140
    Article MATH Google Scholar
  12. Liu J.W.H. (1992) The multifrontal method for sparse matrix solution: theory and practice. SIAM Rev. 34: 82–109
    Article MATH Google Scholar

Download references

Author information

Authors and Affiliations

  1. IBM T.J. Watson Research Center, 1101 Kitchawan Road, Yorktown Heights, NY, 10598, USA
    Anshul Gupta

Corresponding author

Correspondence toAnshul Gupta.

Rights and permissions

About this article

Cite this article

Gupta, A. A Shared- and distributed-memory parallel general sparse direct solver.AAECC 18, 263–277 (2007). https://doi.org/10.1007/s00200-007-0037-x

Download citation

Keywords