Recent progress in general sparse direct solvers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2073, Issue , 2001, Pages 823-831

  Gupta, Anshul ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DIRECT SOLUTION; REAL APPLICATIONS; RECENT PROGRESS; SPARSE DIRECT SOLVER; SPARSE MATRICES; SPARSE SOLVERS; SPARSE SYSTEMS; SPARSE SYSTEMS OF LINEAR EQUATIONS;

ARTIFICIAL INTELLIGENCE;

EID: 33745306411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45545-0_94     Document Type: Conference Paper

References (26)

1. Patrick R. Amestoy, Iain S. Duff, Jacko Koster, and J. Y. L'Execellent. A fully asynchronous multifrontal solver using distributed dynamic scheduling. Technical Report RT/APO/99/2, ENSEEIHT-IRIT (Toulouse, France), 1999. To appear in SIAM Journal on Matrix Analysis and Applications.
2. Patrick R. Amestoy, Iain S. Duff, and J. Y. L'Execellent. Multifrontal parallel distributed symmetric and unsymmetric solvers. Computational Methods in Applied Mechanical Engineering, 184:501-520, 2000. Also available at http://www.enseeiht.fr/apo/MUMPS/.
3. Patrick R. Amestoy, Iain S. Duff, J. Y. L'Execellent, and Xiaoye S. Li. Analysis, tuning, and comparison of two general sparse solvers for distributed memory computers. Technical Report RT/APO/00/2, ENSEEIHT-IRIT, Toulouse, France, 2000. Also available as Technical Report 45992 from Lawrence Berkeley National Laboratory.
4. Cleve Ashcraft and Roger G. Grimes. SPOOLES: An object-oriented sparse matrix library. In Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, March 1999.
5. Cleve Ashcraft and Joseph W.-H. Liu. Robust ordering of sparse matrices using multisection. Technical Report CS 96-01, Department of Computer Science, York University, Ontario, Canada, 1996.
6. Michel Cosnard and Laura Grigori. Using postordering and static symbolic factorization for parallel sparse LU. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2000.
7. Timothy A. Davis, Patrick Amestoy, and Iain S. Duff. An approximate minimum degree ordering algorithm. Technical Report TR-94-039, Computer and Information Sciences Department, University of Florida, Gainesville, FL, 1994.
8. Timothy A. Davis and Iain S. Duff. An unsymmetric-pattern multifrontal method for sparse LU factorization. SIAM Journal on Matrix Analysis and Applications, 18(1):140-158, January 1997.
9. James W. Demmel, Stanley C. Eisenstat, John R. Gilbert, Xiaoye S. Li, and Joseph W.-H. Liu. A supernodal approach to sparse partial pivoting. SIAM Journal on Matrix Analysis and Applications, 20(3):720-755, 1999.
10. Iain S. Duff, A. M. Erisman, and John K. Reid. Direct Methods for Sparse Matrices. Oxford University Press, Oxford, UK, 1990.
11. Iain S. Duff and Jacko Koster. On algorithms for permuting large entries to the diagonal of a sparse matrix. Technical Report RAL-TR-1999-030, Rutherford Appleton Laboratory, April 19, 1999.
12. Iain S. Duff and John K. Reid. The multifrontal solution of unsymmetric sets of linear equations. SIAM Journal on Scientific and Statistical Computing, 5(3):633-641, 1984.
13. Alan George and Joseph W.-H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, NJ, 1981.
14. John R. Gilbert and Joseph W.-H. Liu. Elimination structures for unsymmetric sparse LU factors. SIAM Journal on Matrix Analysis and Applications, 14(2):334-352, 1993.
15. Anshul Gupta. A high-performance GEPP-based sparse solver. Technical report, IBM T. J. Watson Research Center, Yorktown Heights, NY, 2001. ftp://ftp.cs.umn.edu/users/kumar/anshul/parco-01.ps.
16. Anshul Gupta. Fast and effective algorithms for graph partitioning and sparse matrix ordering. IBM Journal of Research and Development, 41(1/2):171-183, January/March, 1997.
17. Anshul Gupta. WSMP: Watson sparse matrix package (Part-II: direct solution of general sparse systems). Technical Report RC 21888 (98472), IBM T. J. Watson Research Center, Yorktown Heights, NY, November 20, 2000. http://www.cs.umn.edu/~agupta/wsmp.html.
18. Anshul Gupta. Graph partitioning based sparse matrix ordering algorithms for finite-element and optimization problems. In Proceedings of the Second SIAM Conference on Sparse Matrices, October 1996.
19. Anshul Gupta and Yanto Muliadi. An experimental comparison of some direct sparse solver packages. Technical Report RC 21862 (98393), IBM T. J. Watson Research Center, Yorktown Heights, NY, October 25, 2000. ftp://ftp.cs.umn.edu/users/kumar/anshul/solver-compare.ps.
20. Anshul Gupta and Lexing Ying. Algorithms for finding maximum matchings in bipartite graphs. Technical Report RC 21576 (97320), IBM T. J. Watson Research Center, Yorktown Heights, NY, October 19, 1999.
21. Steven Michael Hadfield. On the LU Factorization of Sequences of Identically Structured Sparse Matrices within a Distributed Memory Environment. PhD thesis, University of Florida, Gainsville, FL, 1994.
22. Xiaoye S. Li and James W. Demmel. Making sparse Gaussian elimination scalable by static pivoting. In Supercomputing '98 Proceedings, 1998.
23. Xiaoye S. Li and James W. Demmel. A scalable sparse direct solver using static pivoting. In Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999.
24. Joseph W.-H. Liu. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Review, 34:82-109, 1992.
25. Olaf Schenk, Wolfgang Fichtner, and Klaus Gartner. Scalable parallel sparse LU factorization with a dynamical supernode pivoting approach in semiconductor device simulation. Technical Report 2000/10, Integrated Systems Laboratory, Swiss Federal Institute of Technology, Zurich, November 2000.
26. Kai Shen, Tao Yang, and Xiangmin Jiao. S+: Efficient 2D sparse LU factorization on parallel machines. SIAM Journal on Matrix Analysis and Applications, To be published.