A Shared- and distributed-memory parallel general sparse direct solver

Applicable Algebra in Engineering, Communications and Computing

Volumn 18, Issue 3, 2007, Pages 263-277

  Gupta, Anshul ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Multifrontal methods; Parallel sparse solvers; Sparse LU decomposition; Sparse matrix factorization

Indexed keywords

ALGORITHMS; LINEAR EQUATIONS; MATRIX ALGEBRA; NUMERICAL METHODS;

MULTIFRONTAL METHODS; PARALLEL SPARSE SOLVERS; SPARSE LU DECOMPOSITION; SPARSE MATRIX FACTORIZATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34547685895     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-007-0037-x     Document Type: Article

References (12)

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
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
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
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
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
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
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
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
12. Liu J.W.H. (1992) The multifrontal method for sparse matrix solution: theory and practice. SIAM Rev. 34: 82-109