A tree-based dataflow model for the unsymmetric multifrontal method

Electronic Transactions on Numerical Analysis

Volumn 21, Issue , 2005, Pages 1-19

  Eisenstat, Stanley C ^a   Liu, Joseph W H ^b  

^a Yale University   (United States)

^b YORK UNIVERSITY   (Canada)

Author keywords

Elimination tree; Sparse LU decomposition; Sparse matrix factorization

Indexed keywords

DATA TRANSFER; LINEAR SYSTEMS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; PROBLEM SOLVING; TREES (MATHEMATICS);

ELIMINATION TREE; POSTORDERING; SPARSE LU DECOMPOSITION; SPARSE MATRIX FACTORIZATION;

DATA PROCESSING;

EID: 31444435892     PISSN: 10689613     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. A. V. AHO, M. R. GAREY, AND J. D. ULLMAN, The transitive reduction of a directed graph, STAM J. Comput., 1 (1972), pp. 131-137.
2. P. R. AMESTOY AND I. S. DUFF, Vectorization of a multiprocessor multifrontal code, International Journal of Supercomputer Applications, 3 (1989), pp. 41-59.
3. 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.
4. P. R. AMESTOY AND C. PUOLISI, An unsymmetrized multifrontal LU factorization, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 553-569.
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, Intern. J. of Supercomputer Applications, 1 (1987), pp. 10-30.
6. 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.
7. 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.
8. I. S. DUFF AND J. K. REID, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software., 9 (1983), pp. 302-325.
9. _, The multifrontal solution of unsymmetric sets of linear equations, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 633-641.
10. S. C. EISENSTAT AND J. W. H. LIU, Algorithmic aspects of elimination trees for sparse unsymmetric matrices, tech. rep., Department of Computer Science, York University, Toronto, Canada, 2005.
11. _, The theory of elimination trees for sparse unsymmetric matrices, SIAM J. Matrix Anal. Appl., 26 (2005), pp. 686-705.
12. K. A. GALLIVAN, B. A. MARSOLF, AND H. A. G. WIJSHOFF, Solving large nonsymmetric sparse linear systems using MCSPARSE, Parallel Comput., 22 (1996), pp. 1291-1333.
13. A. GUPTA, Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 529-552.
14. S. M. HADFIELD, On the LU Factorization of Sequences of Identically Structured Sparse Matrices Within a Distributed Memory Environment, PhD thesis, University of Florida, Apr. 1994.
15. S. M. HADFIELD AND T. A. DAVIS, Lost pivot recovery for an unsymmetric-pattern multifrontal method, Tech. Rep. TR-94-029, University of Florida, 1994.
16. X. S. LI AND J. W. DEMMEL, Making sparse Gaussian elimination scalable by static pivoting, in Proceedings of Supercomputing '98, Nov. 1998.
17. _, SuperLU-DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems, ACM Trans. Math. Software., 29 (2003), pp. 110-140.
18. J. W. H. LIU, The multifrontal method for sparse matrix solution: Theory and practice, SIAM Review, 34 (1992), pp. 82-109.
19. B. SPEELPENNINO, The generalized element method, Tech. Rep. UILCDCS-R-78-946, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois, Nov. 1978.