Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 24, Issue 2, 2003, Pages 529-552

  Gupta, Anshul ^a  

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

Author keywords

Multifrontal methods; Parallel sparse solvers; Sparse matrix factorization

Indexed keywords

EID: 0037265634     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089547980139604X     Document Type: Article

References (23)

1. P. R. AMESTOY, T. A. DAVIS, AND T. S. DUFF, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 886-905.
2. P. R. AMESTOY AND I. S. DUFF, Vectorization of a multiprocessor multifrontal code, Internat. J. Supercomputer Appl., 3 (1989), pp. 41-59.
3. P. R. AMESTOY AND I. S. DUFF, Memory management issues in sparse multifrontal methods on multiprocessors, Internat. J. Supercomputer Appl., 7 (1993), pp. 64-82.
4. P. R. AMESTOY, I. S. DUFF, J. KOSTER, AND J.-Y. L'EXCELLENT, A fully asynchronous multifrontal solver using distributed dynamic scheduling, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 35-41.
5. P. R. AMESTOY, I. S. DUFF, AND J. Y. L'EXCELLENT, Multifrontal parallel distributed symmetric and unsymmetric solvers, Comput. Methods Appl. Mech. Engrg., 184 (2000). pp. 501-520.
6. P. R. AMESTOY, I. S. DUFF, J. Y. L'EXCELLENT, AND X. S. LI, Analysis and comparison of two general sparse solvers for distributed memory computers, ACM Trans. Math. Software, 27 (2001), pp. 388-421.
7. C. ASHCRAFT AND R. G. GRIMES, The influence of relaxed supernode partitions on the multifrontal method, ACM Trans. Math. Software, 15 (1989), pp. 291-309.
8. T. A. DAVIS, UMFPACK V3.2: An Unsymmetric-Pattern Multifrontal Method with a Column Pre-ordering Strategy, Technical Report TR-02-2002, Computer and Information Sciences Department, University of Florida, Gainesville, FL, 2002.
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, S. I. LARIMORE, AND E. G.-Y. NG, A Column Approximate Minimum Degree Ordering Algorithm, Technical Report TR-00-005, Computer and Information Sciences Department, University of Florida, Gainesville, FL, 2000.
11. J. W. DEMMEL, S. C. EISENSTAT, J. R. GILBERT, X. S. LI, AND J. W. H. LIU, A supernodal approach to sparse partial pivoting, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 720-755.
12. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Oxford University Press, Oxford, UK, 1990.
13. I. S. DUFF AND J. KOSTER, On algorithms for permuting large entries to the diagonal of a sparse matrix, SIAM J. Matrix Anal. Appl., 22 (2001), pp. 973-996.
14. I. S. DUFF AND J. K. REID, The multifrontal solution of unsymmetric sets of linear equations, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 633-641.
15. S. C. EISENSTAT AND J. W. H. LIU, Exploiting structural symmetry in unsymmetric sparse symbolic factorization, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 202-211.
16. 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.
17. A. GUPTA, Fast and effective algorithms for graph partitioning and sparse matrix ordering, IBM J. Res. Development, 41 (1997), pp. 171-183.
18. A. GUPTA, Recent advances in direct methods for solving unsymmetric sparse systems of linear equations, ACM Trans. Math. Software, 28 (2002), pp. 301-324.
19. A. GUPTA, G. KARYPIS, AND V. KUMAR, Highly scalable parallel algorithms for sparse matrix factorization, IEEE Trans. Parallel Distrib. Syst., 8 (1997), pp. 502-520.
20. S. M. HADFIELD, On the LU Factorization of Sequences of Identically Structured Sparse Matrices within a Distributed Memory Environment, Ph.D. thesis, University of Florida, Gainesville, FL, 1994.
21. X. S. LI AND J. W. DEMMEL, A scalable sparse direct solver using static pivoting, in Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1999, CD-ROM.
22. J. W. H. LIU, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 134-172.
23. J. W. H. LIU, The multifrontal method for sparse matrix solution: Theory and practice, SIAM Rev., 34 (1992), pp. 82-109.