SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems

ACM Transactions on Mathematical Software

Volumn 29, Issue 2, 2003, Pages 110-140

  Li, Xiaoye S ^a   Demmel, James W ^b,c  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Distributed memory computers; Parallelism; Scalability; Sparse direct solver; Supernodal factorization

Indexed keywords

DISTRIBUTED-MEMORY COMPUTERS; PARALLELISM; SCALABILITY; SPARSE DIRECT SOLVER; SUPERNODAL FACTORIZATION;

ALGORITHMS; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; LINEAR EQUATIONS; PARALLEL PROCESSING SYSTEMS; SOFTWARE ENGINEERING;

LINEAR SYSTEMS;

EID: 0038621899     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/779359.779361     Document Type: Article

References (59)

1. ALVARADO, F. L., POTHEN, A., AND SCHREIBER, R. 1993. Highly parallel sparse triangular solution. In Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. LIU, Eds. Springer-Verlag, New York, NY, 159-190.
2. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 4, 886-905. Also published as Tech. Rep. TR-94-039, University of Florida, Gainesville, FL.
3. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 4, 886-905. Also published as Tech. Rep. TR-94-039, University of Florida, Gainesville, FL.
4. AMESTOY, P. R. AND DUFF, I. S. 1993. Memory management issues in sparse multifrontal methods on multiprocessors. Internat. J. Supercomput. Appl. 7, 1 (Spring), 64-82.
5. AMESTOY, P. R., DUFF, I. S., L'EXCELLENT, J.-Y, AND KOSTER, J. 2001a. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23, 1, 15-41.
6. AMESTOY, P. R., DUFF, I. S., L'EXCELLENT, J.-Y, AND LI, X. S. 2001b. Analysis and comparison of two general sparse solvers for distributed memory computers. ACM Trans. Math. Softw. 27, 4 (Dec.), 388-421.
7. AMESTOY, P. R., LI, X. S., AND NG, E. G. 2003. Diagonal markowitz scheme with local symmetrization. Tech. rep., Lawrence Berkeley National Laboratory- In preparatioon.
8. AMESTOY, P. R. AND PUGLISI, C. 2002. An unsymmetrized multifrontal LU factorization. SIAM J. Matrix Anal. Appl. 24, 2, 553-569.
9. ARIOLI, M., DEMMEL, J. W., AND DUFF, I. S. 1989. Solving sparse linear systems with sparse backward error. SIAM J. Matrix Anal. Appl. 10, 2 (April), 165-190.
10. ASHCRAFT, C. AND GRIMES, R. G. 1999. SPOOLES: An object oriented sparse matrix library. In Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing. (San Antonio, TX. Available online at http://www.netlib.org/linalg/spooles.)
11. ASHCRAFT, C. AND LIU, J. 1998. Robust ordering of sparse matrices using multisection. SIAM J. Matrix Anal. Appl. 19, 816-832.
12. BAERTSCHY, M. AND LI, X. S. 2001. Solution of a three-body poblem in quantum mechanics. In Proceedings of SC2001: High Performance Networking and Computing Conference (Denver, CO).
13. BENZI, M., HAWS, J. C., AND TUMA, M. 2000. Preconditioning highly indefinite and nonsymmetric matrices. SIAM J. Sci. Comput. 22, 1333-1353.
14. BLACKFORD, L. S., CHOI, J., D'AZEVEDO, E., DEMMEL, J., DHILLON, I., DONGARRA, J., HAMMARLING, S., HENRY, G., PETITET, A., STANLEY, K., WALKER, D., AND WHALEY, R. C. 1997. ScaLAPACK Users' Guide. SIAM, Philadelphia, PA.
15. CHEN, T.-Y. 2001. Preconditioning sparse matrices for computing eigenvalues and computing linear systems of equations. Ph.D. dissertation, Computer Science Division, University of California, Berkeley, Berkeley, CA.
16. DAVIS, T. A. n.d. University of Florida sparse matrix collection. Available online at http://www.cise.ufl.edu/̃davis/sparse.
17. DAVIS, T. A. AND DUFF, I. S. 1999. A combined unifrontal/multifrontal method for unsymmetric sparse matrices. ACM Trans. Math. Softw. 25, 1, 1-19.
18. DAVIS, T. A., GILBERT, J. R., LARIMORE, S. I., AND NG, E. 2000. A column approximate minimum degree ordering algorithm. Tech. Rep. TR-00-005, Computer and Information Sciences Department, University of Florida, Gainesville, FL. Submitted to ACM Trans. Math. Software.
19. DEMMEL, J. W. 1997. Applied Numerical Linear Algebra. SIAM, Philadelphia, PA.
20. DEMMEL, J. W., EISENSTAT, S. C., GILBERT, J. R., LI, X. S., AND LIU, J. W. H. 1999a. A supernodal approach to sparse partial pivoting. SIAM J. Matrix Anal. Appl. 20, 3, 720-755.
21. DEMMEL, J. W., GILBERT, J. R., AND LI, X. S. 1999b. An asynchronous parallel supernodal algorithm for sparse Gaussian elimination. SIAM J. Matrix Anal. Appl. 20, 4, 915-952.
22. DUFF, I., ERISMAN, I., AND REID, J. 1986. Direct Methods for Sparse Matrices. Oxford University Press, London, England.
23. DUFF, I., GRIMES, R., AND LEWIS, J. 1992. Users' guide for the Harwell-Boeing sparse matrix collection (release 1). Tech. Rep. RAL-92-086, Rutherford Appleton Laboratory, Chilton, Didcot, Oxfordshire, U.K.
24. DUFF, I. S. AND KOSTER, J. 1999. The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl. 20, 4, 889-901.
25. FU, C., JIAO, X., AND YANG, T. 1998. Efficient sparse LU factorization with partial pivoting on distributed memory architectures. IEEE Trans. Parallel Distrib. Syst. 9, 2, 109-125.
26. GEORGE, A. 1973. Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10, 345-363.
27. GEORGE, A., LIU, J., AND NG, E. 1988. A data structure for sparse QR and LU factorizations. SIAM J. Sci. Stat. Comput. 9, 100-121.
28. GEORGE, A. AND LIU, J. W. H. 1981. Computer Solution of Large Sparse Positive Definite Systems. Prentice Hall, Englewood Cliffs, NJ.
29. GEORGE, A. AND NG, E. 1987. Symbolic factorization for sparse Gaussian elimination with partial pivoting. SIAM J. Sci. Stat. Comput. 8, 6, 877-898.
30. GILBERT, J. R. 1994. Predicting structures in sparse matrix computations. SIAM J. Matrix Anal. Appl. 15, 1 (Jan.), 62-79.
31. GILBERT, J. R. AND LIU, J. W. 1993. Elimination structures for unsymmetric sparse LU factors. SIAM J. Matrix Anal. Appl. 14, 2 (April), 334-352.
32. GOLUB, G. AND VAN LOAN, C. 1996. Matrix Computations, 3rd ed. Johns Hopkins University Press, Baltimore, MD.
33. GUPTA, A. 2000. WSMP: Watson Sparse Matrix Package. Tech. Rep., IBM Research Division, T.J. Watson Research Center, Yorktown Heights, NY. Available online at http://www.cs.umn.edu/̃agupta/wsmp.html.
34. GUPTA, A. 2001. Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices. Tech. Rep. RC 22137 (99131), IBM Research Center, Yorktown Heights, NY.
35. GUPTA, A., KARYPIS, G., AND KUMAR, V. 1997. Highly scalable parallel algorithms for sparse matrix factorization. IEEE Trans. Parallel Distrib. Syst. 8, 502-520.
36. GUPTA, A. AND KUMAR, V. 1995. Optimally scalable parallel sparse cholesky factorization. In The 7th SIAM Conference on Parallel Processing for Sci. Comput. 442-447.
37. HEATH, M. T. AND RAGHAVAN, P. 1997. Performance of a fully parallel sparse solver. Internat. J. Supercomput. Appl. 11, 1, 49-64.
38. HENDRICKSON, B. AND LELAND, R. 1993. The CHACO User's Guide. Version 1.0. Tech. Rep. SAND93-2339 • UC-405, Sandia National Laboratories, Albuquerque, NM.
39. HENON, P., RAMET, P., AND ROMAN, J. 1999. A mapping and scheduling algorithm for parallel sparse fan-in numerical factorization. In EuroPar'99 Parallel Processing. Lecture Notes in Computer Science, vol. 1685. Springer-Verlag, Berlin, Heidelberg, New York, 1059-1067.
40. HSL. 2000. A collection of Fortran codes for large scale scientific computation. Available online at http://www.cse.clrc.ac.uk/Activity/HSL.
41. JONES, M. T. AND PLASSMANN, P. E. 1994. Scalable iterative solution of sparse linear systems. Parallel Comput. 20, 753-773.
42. KARYPIS, G. AND KUMAR, V. 1998. METIS - A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices - Version 4.0. University of Minnesota, Minneapolis, MN.
43. KUMAR, V., GRAMA, A., GUPTA, A., AND KARYPIS, G. 1994. Introduction to Parallel Computing. Benjamin/Cummings, Redwood City, CA.
44. LEHOUCQ, R., MASCHHOFF, K., SORENSEN, D., AND YANG, C. n.d. Parallel ARPACK. Available online at http://www.caam.rice.edu/̃kristyn/parpack_home.html.
45. LI, X. S. AND DEMMEL, J. W. 1998. Making sparse Gaussian elimination scalable by static pivoting. In Proceedings of SC98: High Performance Networking and Computing Conference (Orlando, FL).
46. LI, X. S. AND DEMMEL, J. W. 2002. SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems. Tech. Rep. LBNL-49388, Lawrence Berkeley National Laboratory, Berkeley, CA.
47. LI, X. S., DEMMEL, J. W., BAILEY, D. H., HENRY, G., HIDA, Y., ISKANDAR, J., KAHAN, W., KANG, S. Y., KAPUR, A., MARTIN, M. C., THOMPSON, B. J., TUNG, T., AND YOO, D. J. 2002. Design, implementation and testing of extended and mixed precision BLAS. ACM Trans. Math. Softw. 28, 2, 152-205.
48. LIU, J. W. 1985. Modification of the minimum degree algorithm by multiple elimination. ACM Trans. Math. Softw. 11, 141-153.
49. LIU, J. W. 1990. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11, 1 (Jan.), 134-172.
50. MARKOWITZ, H. M. 1957. The elimination form of the inverse and its application to linear programming. Management Sci. 3, 255-269.
51. MPI. n.d. Message Passing Interface (MPI) forum. Available online at http://www.mpi-forum.org/.
52. OLSHOWKA, M. AND NEUMAIER, A. 1996. A new pivoting strategy for Gaussian elimination. Linear Algebra Appl. 240, 131-151.
53. RAGHAVAN, P. 1995. Efficient parallel sparse triangular solution with selective inversion. Tech. Rep. CS-95-314, Department of Computer Science, University of Tennessee, Knoxville, TN.
54. RESCIGNO, T. N., BAERTSCHY, M., ISAACS, W. A., AND MCCURDY, C. W. 1999. Collisional breakup in a quantum system of three charged particles. Science 286, 5449, 2474-2479.
55. REEDY, J. 2003. Parallel bipartite matching for sparse matrix computation. In preparation.
56. ROTHBERG, E. 1996. Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers. SIAM J. Sci. Comput. 17, 3 (May), 699-713.
57. SAAD, Y. n.d. SPARSKIT: A basic tool-kit for sparse matrix computations (Version 2). University of Minnesota, Minneapolis, MN. Available online at http://www.cs.umn.edu/Research/arpa/SPARSKIT/sparskit.html.
58. SAAD, Y. AND SCHULTZ, M. H. 1986. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7, 856-869.
59. SCHENK, O., GÄRTNER, K., AND FICHTNER, W. 2000. Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors. BIT 40, 1, 158-176.