An overview of SuperLU: Algorithms, implementation, and user interface

ACM Transactions on Mathematical Software

Volumn 31, Issue 3, 2005, Pages 302-325

  Li, Xiaoye S ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

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

Indexed keywords

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

ALGORITHMS; CODES (SYMBOLS); DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; USER INTERFACES;

COMPUTER SOFTWARE;

EID: 24344434086     PISSN: 00983500     EISSN: 00983500     Source Type: Journal    
DOI: 10.1145/1089014.1089017     Document Type: Review

References (40)

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.
3. Also published as Tech. rep. TR-94-039, University of Florida, Gainesville, FL.
4. AMESTOY, P. R., DUFF, I. S., L'EXCELLENT, J.-Y., AND KOSTER, J. 2003a. MUltifrontal Massively Parallel Solver (MUMPS version 4.3) users' guide. ENSEEIHT-IRIT, Toulouse, France.
5. AMESTOY, P. R., Li, X. S., AND NG, E. G. 2003b. Diagonal Markowitz scheme with local symmetrization. Tech. rep. LBNL-53854. Lawrence Berkeley National Laboratory, Berkeley, CA.
6. Also publised as Tech. rep. RT/APO/03/05. ENSEEIHT-IRIT, Toulouse, France.
7. ANDERSON, E., BAI, Z., BISCHOF, C., BLACKFORD, S., DEMMEL, J., DONGARRA, J., DU CROZ, J., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., AND SORENSEN, D. 1999. LAPACK Users' Guide, Release 3.0. SIAM Press, Philadelphia, PA.
8. 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 (Apr.), 165-190.
9. 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.
10. BAERTSCHY, M. AND LI, X. S. 2001. Solution of a three-body problem in quantum mechanics. In Proceedings of SC2001: High Performance Networking and Computing Conference (Denver, CO).
11. BAERTSCHY, M., RESCIGNO, T., ISAACS, W., LI, X., AND MCUURDY, C. 2001a. Electron-impact ionization of atomic hydrogen. Phys. Rev. A 63, 022712.
12. BAERTSCHY, M., RESCIGNO, T. N., AND MCCURDY, C. W. 2001b. Accurate amplitudes for electron-impactionization Phys. Rev. Lett. 64, 022709.
13. 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. Submitted to ACM Trans. Math. Software.
14. DEMMEL, J. W. 1997. Applied Numerical Linear Algebra. SIAM Press, Philadelphia, PA.
15. 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.
16. 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.
17. DEMMEL, J. W., GILBERT, J. R., AND LI, X. S. 1999c. SuperLU users' guide. Tech. rep. LBNL-44289. Lawrence Berkeley National Laboratory, Berkeley, CA. Software is available online at http://crd.lbl.gov/~xiaoye/SuperLU.
18. 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.
19. EISENSTAT, S. C. AND LIU, J. W. 1992. Exploiting structural symmetry in sparse unsymmetric symbolic factorization. SIAM J. Matrix Anal. Appl., 13, 202-211.
20. 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.
21. GEORGE, A. AND NG, E. 1987. Symbolic factorization for sparse Gaussian elimination with partial pivoting. SIAM J. Sci. Stat. Comput. 8, 6, 877-898.
22. GILBERT, J. R. AND PEIERLS, T. 1988. Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Stat. Comput. 9, 862-874.
23. GRIGORI, L. AND LI, X. S. 2002. A new scheduling algorithm for parallel sparse LU factorization with static pivoting. In Proceedings of SC2002. (Baltimore, MD).
24. 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. Available online at http://www.cs.sandia.gov/~bahendr/chaco. html.
25. HIGHAM, N. J. 1996. Accuracy and Stability of Numerical Algorithms. SIAM Press, Philadelphia, PA.
26. HUSBANDS, P., YANG, C., LI, X., NG, E., SUN, Y., KO, K., AND GOLUB, G. 2003. When computing interior eigenvalues, just how far can a direct solver take you? In SIAM Annual Meeting (June) Montreal, P.Q., Canada.
27. 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. Available online at http://www-users.cs.umn.edu/ ~karypis/metis.
28. KARYPIS, G., SCHLOEGEL, K., AND KUMAR, V. 2003. PARMETIS: Parallel Graph Partitioning and Sparse Matrix Ordering Library - Version 3.1. University of Minnesota, Minneapolis, MN. Available online at http://www-users.cs.umn.edu/ ~karypis/metis/parmatis/.
29. 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).
30. LI, X. S. AND DEMMEL, J. W. 2003. SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems. ACM Trans. Math. Softw. 29, 2 (June), 110-140.
31. 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.
32. LI, X. S. AND WANG, Y. 2003. Performance evaluation and enhancement of SuperLU_DIST 2.0. Tech. rep. LBNL-53624. Lawrence Berkeley National Laboratory, Berkeley, CA.
33. LIU, J. W. 1985. Modification of the minimum degree algorithm by multiple elimination. ACM Trans. Math. Software 11, 141-153.
34. MARKOWITZ, H. M. 1957. The elimination form of the inverse and its application to linear programming. Management Sci. 3, 255-269.
35. OETTLI, W. AND PRAGER, W. 1964. Compatibility of approximate solution of linear equations with given error bounds for coefficients and right hand sides. Num. Math. 6, 405-409.
36. PELLEGRINI, F. 2001. SCOTCH 3.4 user's guide. Tech rep. 1264-01. University Bordeaux I, Bordeaux, France. Available online at http://www.labri.fr/~pelagrin/scotch.
37. PRALET, S., AMESTOY, P. R., AND LI, X. S. 2005. Unsymmetric ordering using a constraint Markowitz scheme. Tech. rep. LBNL-56861. Lawrence Berkeley National Laboratory, Berkeley, CA.
38. RESCIGNO, T. N., BAERTSCHY, M., ISAACS, W. A., AND MCCUHDY, C. W. 1999. Collisional breakup in a quantum system of three charged particles. Science 286, 5449 (Dec. 24), 2474-2479.
39. SCHENK, O. AND GÄRTNER, K. 2004. Parallel sparse direct linear solver PARDISO, user guide version 1.2. Available online at http://www. computational.unibas.ch/cs/scicomp/software/pardiso/.
40. SUN, Y. 2003. The filter algorithm for solving large-scale eigenproblems from accelerator simulations. Ph.D. dissertation. Department of Computer Science, Stanford University, Stanford, CA.