A supernodal approach to sparse partial pivoting

SIAM Journal on Matrix Analysis and Applications

Volumn 20, Issue 3, 1999, Pages 720-755

  Demmel, James W ^a   Eisenstat, Stanley C ^b   Gilbert, John R ^c   Li, Xiaoye S ^d   Liu, Joseph W H ^e  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Yale University   (United States)

^c PALO ALTO RESEARCH CENTER   (United States)

^d LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^e YORK UNIVERSITY   (Canada)

Author keywords

Column elimination tree; Partial pivoting; Sparse matrix algorithms; Supernodes; Unsymmetric linear systems

Indexed keywords

EID: 0033239808     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479895291765     Document Type: Article

References (45)

1. R. AGARWAL, F. GUSTAVSON, P. PALKAR, AND M. ZUBAIR, A performance analysis of the subroutines in the ESSL/LAPACK call conversion interface (CCI), IBM T.J. Watson Research Center, Yorktown Heights, NY, 1994.
2. P. R. AMESTOY AND I. DUFF, Vectorization of a multiprocessor multifrontal code, Int. J. Supercomputer Appl., 7 (1993), pp. 64-82.
3. E. ANDERSON ET AL., LAPACK User's Guide, 2nd ed., SIAM, Philadelphia, PA, 1995.
4. C. ASHCRAFT AND R. GRIMES, The influence of relaxed supernode partitions on the multifrontal method, ACM Trans. Math. Software, 15 (1989), pp. 291-309.
5. C. ASHCRAFT, R. GRIMES, J. LEWIS, B. PEYTON, AND H. SIMON, Progress in sparse matrix methods for large sparse linear systems on vector supercomputers, Internat. J. of Supercomputer Applications, 1 (1987), pp. 10-30.
6. J. BILMES, K. ASANOVIC, J. DEMMEL, D. LAM, AND C.-W. CHIN, Optimizing Matrix Multiply Using PHiPAC: A Portable, High-Performance, ANSI C Coding Methodology, Tech. Report CS-96-326, Computer Science Department., University of Tennessee, Knoxville, TN, May 1996. (LAPACK Working Note #111).
7. T. A. DAVIS, User's Guide for the Unsymmetric-Pattern MultiFrontal Package (UMFPACK), Tech. Report TR-95-004, Computer and Information Sciences Department, University of Florida, Gainesville, FL, January 1995.
8. T. A. DAVIS AND I. S. DUFF, A combined unifrontal/multifrontal method for unsymmetric sparse matrices, Tech. Report TR-95-020, Computer and Information Sciences Department, University of Florida, Gainesville, FL, 1995.
9. T. A. DAVIS AND I. S. DUFF, An unsymmetric-pattern multifrontal method for sparse LU factorization, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 140-158.
10. T. A. DAVIS, J. R. GILBERT, E. NG, AND B. W. PEYTON, A column approximate minimum degree ordering algorithm, Presented at Sixth SIAM Symposium on Applied Linear Algebra, Snowbird, UT, 1997.
11. J. W. DEMMEL, J. R. GILBERT, AND X. S. LI, An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination, Tech. Report UCB//CSD-97-943, Computer Science Division, University of California, Berkeley, CA, 1997.
12. J. W. DEMMEL, J. R. GILBERT, AND X. S. LI, SuperLU User's Guide, Tech. Report UCB//CSD-97-944, Computer Science Division, University of California, Berkeley, CA, 1997.
13. D. DODSON AND J. LEWIS, Issues relating to extension of the basic linear algebra subprograms, ACM SIGNUM Newsletter, 20 (1985), pp. 2-18.
14. J. J. DONGARRA, J. D. CROZ, S. HAMMARLING, AND R. J. HANSON, An extended set of basic linear algebra subroutines, ACM Trans. Math. Software, 14 (1988), pp. 1-17, 18-32.
15. I. DUFF AND J. REID, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, 9 (1983), pp. 302-325.
16. I. DUFF AND J. K. REID, The design of MA48, a code for the direct solution of sparse unsymmetric linear systems of equations, ACM Trans. Math. Software, 22 (1996), pp. 187-226.
17. I. S. DUFF, R. GRIMES, AND J. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
18. I. S. DUFF AND J. K. REID, MA48, a Fortran Code for Direct Solution of Sparse Unsymmetric Linear Systems of Equations, Tech. Report RAL-93-072, Rutherford Appleton Laboratory, Oxon, UK, 1993.
19. S. C. EISENSTAT, J. R. GILBERT, AND J. W. LIU, A supernodal approach to a sparse partial pivoting code, in Householder Symposium 12, Los Angeles, CA, 1993.
20. S. C. EISENSTAT AND J. W. H. LIU, Exploiting structural symmetry in sparse unsymmetric symbolic factorization, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 202-211.
21. S. C. EISENSTAT AND J. W. H. LIU, Exploiting structural symmetry in a sparse partial pivoting code, SIAM J. Sci. Statist. Comput., 14 (1993), pp. 253-257.
22. J. A. GEORGE AND E. NG, An implementation of Gaussian elimination with partial pivoting for sparse systems, SIAM J. Sci. Statist. Comput., 6 (1985), pp. 390-409.
23. J. A. GEORGE AND E. NG, Symbolic factorization for sparse Gaussian elimination with partial pivoting, SIAM J. Sci. Statist. Comput., 8 (1987), pp. 877-898.
24. J. R. GILBERT, Predicting structure in sparse matrix computations, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 62-79.
25. J. R. GILBERT AND J. W. H. LIU, Elimination structures for unsymmetric sparse LU factors, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 334-352.
26. J. R. GILBERT, C. MOLER., AND R.. SCHREIBER, Sparse matrices in Matlab: Design and implementation, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 333-356.
27. J. R. GILBERT AND E. NG, Predicting structure in nonsymmetric sparse matrix factorizations, in Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. H. Liu, eds., Springer-Verlag, New York, Berlin, 1993.
28. J. R. GILBERT, E. G. NG, AND B. W. PEYTON, An efficient algorithm to compute row and column counts for sparse Cholesky factorization, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 1075-1091.
29. J. R. GILBERT AND T. PEIERLS, Sparse partial pivoting in time proportional to arithmetic operations, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 862-874.
30. J. R. GILBERT AND S. TOLEDO, An assessment of incomplete LU preconditioned for nonsymmetric linear systems, manuscript, 1997.
31. A. GUPTA AND V. KUMAR, Optimally scalable parallel sparse Cholesky factorization, in Proc. 7th SIAM Conference on Parallel Processing for Scientific Computing, D.H. Bailey et. al., eds., SIAM, Philadelphia, 1995, pp. 442-447.
32. International Business Machines Corporation Engineering and Scientific Subroutine Library, Guide and Reference, Version 2 Release 2, Order No. SC23-0526-01, 1994.
33. X. S. LI, Sparse Gaussian Elimination on High Performance Computers, Tech. Report UCB//CSD-96-919, Computer Science Division, Ph.D. dissertation, University of California, Berkeley, CA, 1996.
34. J. W. LIU, Modification of the minimum degree algorithm by multiple elimination, ACM Trans. Math. Software, 11 (1985), pp. 141-153.
35. J. W. H. LIU, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 134-172.
36. PDS: The performance database server, http://performance.netlib.org/performance/, May 1995.
37. E. G. NG AND B. W. PEYTON, Block sparse Cholesky algorithms on advanced uniprocessor computers, SIAM J. Sci. Statist. Comput., 14 (1993), pp. 1034-1056.
38. E. ROTHBERG AND A. GUPTA, Efficient sparse matrix factorization on high-performance workstations-exploiting the memory hierarchy, ACM Trans. Math. Software, 17 (1991), pp. 313-334.
39. E. ROTHBERG AND A. GUPTA, An evaluation of left-looking, right-looking and multifrontal approaches to sparse Cholesky factorization on hierarchical-memory machines, Internat. J. High Speed Comput., 5 (1993), pp. 537-593.
40. E. E. ROTHBERG AND A. GUPTA, An efficient block-oriented approach to parallel sparse Cholesky factorization, in Supercomput., 1993, pp. 503-512.
41. A. H. SHERMAN, On the Efficient Solution of Sparse Systems of Linear and Nonlinear Equations, Ph.D. thesis, Yale University, New Haven, CT, 1975.
42. A. H. SHERMAN, Algorithm 533: NSPIV, a FORTRAN subroutine for sparse Gaussian elimination with partial pivoting, ACM Trans. Math. Software, 4 (1978), pp. 391-398.
43. H. SIMON, P. VU, AND C. YANG, Performance of a Supernodal General Sparse Solver on the CRAY Y-MP: 1.68 GFLOPS with Autotasking, Tech. Report TR SCA-TR-117, Boeing Computer Services, Seattle, WA, 1989.
44. S. A. VAVASIS, Stable finite elements for problems with wild coefficients, SIAM J. Numer. Anal., 33 (1996), pp. 890-916.
45. S. I. LARIMORE, An Approximate Minimum Degree Ordering Algorithm, Tech. Report CISE-TR-98-016, Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, 1998.