Nested-dissection orderings for sparse LU with partial pivoting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1988, Issue , 2001, Pages 125-133

  Brainman, Igor ^a   Toledo, Sivan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DISSECTION; FACTORIZATION; HEURISTIC METHODS; MATRIX ALGEBRA; NUMERICAL ANALYSIS;

CHOLESKY FACTOR; COLUMN ORDERING; COLUMN PERMUTATIONS; LU FACTORIZATION; MINIMUM DEGREE; NESTED DISSECTION; RUNNING TIME; SPARSE MATRICES;

NUMERICAL METHODS;

EID: 0010969914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45262-1_16     Document Type: Conference Paper

References (12)

1. Cleve Ashcraft and Roger Grimes. SPOOLES: An object-oriented sparse matrix library. In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing, San-Antonio, Texas, 1999. 10 pages on CD-ROM.
2. T. A. Davis and I. S. Duff. An unsymmetric-pattern multifrontal method for sparse lu factorization. SIAM Journal on Matrix Analysis and Applications, 19:140-158, 1997.
3. T. A. Davis and I. S. Duff. A combined unifrontal/multifrontal method for unsymmetric sparse matrices. ACM Transactions on Mathematical Software, 25:1-19, 1999.
4. James W. Demmel, Stanley C. Eisenstat, John R. Gilbert, Xiaoye S. Li, and Joseph W. H. Liu. A supernodal approach to sparse partial pivoting. SIAM Journal on Matrix Analysis and Applications, 20:720-755, 1999.
5. A. George and J. W. H. Liu. The evolution of the minimum-degree ordering algorithm. SIAM Review, 31:1-19, 1989.
6. Alan George and Esmond Ng. On the complexity of sparse QR and LU factorization on finite-element matrices. SIAM Journal on Scientific and Statistical Computation, 9:849-861, 1988.
7. John R. Gilbert. Graph Separator Theorems and Sparse Gaussian Elimination. PhD thesis, Stanford University, 1980.
8. John R. Gilbert. Predicting structure in sparse matrix computations. SIAM Journal on Matrix Analysis and Applications, 15:62-79, 1994.
9. John R. Gilbert and Robert Schreiber. Nested dissection with partial pivoting. In Sparse Matrix Symposium 1982: Program and Abstracts, page 61, Fairfield Glade, Tennessee, October 1982.
10. S. I. Larimore. An approximate minimum degree column ordering algorithm. Master’s thesis, Department of Computer and Information Science and Engineering, University of Florida, Gainesville, Florida, 1998. Also available as CISE Tech Report TR-98-016 at ftp://ftp.cise.ufl.edu/cis/tech-reports/tr98/tr98-016.ps.
11. Xiaoye S. Li. Sparse Gaussian Elimination on High Performance Computers. PhD thesis, Department of Computer Science, UC Berkeley, 1996
12. Alex Pothen and Chin-Ju Fan. Computing the block triangular form of a sparse matrix. ACM Transactions on Mathematical Software, 16(4):303-324, December 1990.