The theory of elimination trees for sparse unsymmetric matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 26, Issue 3, 2005, Pages 686-705

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

^a Yale University   (United States)

^b YORK UNIVERSITY   (Canada)

Author keywords

Sparse LU decomposition; Sparse matrix factorization

Indexed keywords

SPARSE LU DECOMPOSITION; SPARSE MATRIX FACTORIZATION; SUBGRAPHS; TRIANGULAR FACTORS;

ALGORITHMS; BLOCK CODES; GRAPH THEORY; MATRIX ALGEBRA; SET THEORY; TOPOLOGY;

TREES (MATHEMATICS);

EID: 22944431546     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089547980240563X     Document Type: Article

References (20)

1. A. V. AHO, M. R. GAREY, AND J. D. ULLMAN, The transitive reduction of a directed graph, SIAM J. Comput., 1 (1972), pp. 131-137.
2. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, Data Structures and Algorithms, Addison-Wesley, Reading, MA, 1983.
3. P. R. AMESTOY, I. S. DUFF, J.-Y. L'EXCELLENT, AND J. KOSTER, A fully asynchronous multifrontal solver using distributed dynamic scheduling, SIAM J. Matrix Anal. Appl., 23(2001), pp. 15-41.
4. P. R. AMESTOY AND C. PUGLISI, An unsymmetrized multifrontal LU factorization, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 553-569.
5. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
6. 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.
7. 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.
8. S. C. EISENSTAT AND J. W. H. LIU, Structural representations of Schur complements in sparse matrices, in Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. H. Liu, eds., Springer-Verlag, New York, 1993, pp. 85-100.
9. S. C. EISENSTAT AND J. W. H. LIU, Algorithmic aspects of elimination trees for sparse unsymmetric matrices, Technical report, Department of Computer Science, York University, Toronto, Canada, 2004.
10. S. C. EISENSTAT AND J. W. H. LIU, A tree-based dataflow model for the unsymmetric multifrontal method, Technical report, Department of Computer Science, York University, Toronto, Canada, 2004.
11. 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.
12. A. GUPTA, Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 529-552.
13. A. GUPTA, Recent advances in direct methods for solving unsymmetric sparse systems of linear equations, ACM Trans. Math. Software, 28 (2002), pp. 301-324.
14. S. M. HADFIELD AND T. A. D AVIS, Lost pivot recovery for an unsymmetric-pattern multifrontal method, Technical report TR-94-029, University of Florida, 1994.
15. X. S. Li AND J. W. DEMMEL, Making sparse Gaussian elimination scalable by static pivoting, in Proceedings of the 1998 ACM/IEEE Conference on Supercomputing, San Jose, CA, IEEE Computer Society, Washington, DC, 1998.
16. X. S. LI AND J. W. DEMMEL, SuperLU DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems, ACM Trans. Math. Software, 29 (2003), pp. 110-140.
17. J. W. H. LIU, A tree model for sparse symmetric indefinite matrix factorization, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 26-39.
18. J. W. H. Liu, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 134-172.
19. D. J. ROSE AND R. E. TARJAN, Algorithmic aspects of vertex elimination of directed graphs, SIAM J. Appl. Math., 34(1978),pp. 176-197.
20. R. SCHREIBER, A new implementation of sparse Gaussian elimination, ACM Trans. Math. Software, 8(1982), pp. 256-276.