Nested-dissection orderings for sparse LU with partial pivoting

SIAM Journal on Matrix Analysis and Applications

Volumn 23, Issue 4, 2002, Pages 998-1012

  Brainman, Igor ^a   Toledo, Sivan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Gaussian elimination; LU factorization; Nested dissection; Partial pivoting; Vertex separators; Wide separators

Indexed keywords

EID: 0036398772     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479801385037     Document Type: Article

References (18)

1. C. Ashcraft and R. Grimes, SPOOLES: An object-oriented sparse matrix library, in Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, TX, 1999, CD-ROM, SIAM, Philadelphia, 1999.
2. P. Berman and G. Schnitger, On the performance of the minimum degree ordering for Gaussian elimination, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 83-88.
3. I. Brainman and S. Toledo, Nested-dissection orderings for sparse LU with partial pivoting, in Proceedings of the 2nd Conference on Numerical Analysis and Applications, Rousse, Bulgaria, 2000, Lecture Notes in Comput. Sci. 1988, L. Vulkuv, J. Waśniewski, and P. Yalamov, eds., Springer, Berlin, 2001, pp. 125-132.
4. I. Brainman and S. Toledo, Nested-dissection orderings for sparse LU with partial pivoting, in Proceedings of the Tenth SIAM Conference on Parallel Processing for Scientific Computing, Norfolk, VA, 2001, CD-ROM, SIAM, Philadelphia, 2001.
5. 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.
6. T.A. Davis and I.S. Duff, A combined unifrontal/multifrontal method for unsymmetric sparse matrices, ACM Trans. Math. Software, 25 (1999), pp. 1-19.
7. T.A. Davis, J.R. Gilbert, S.I. Larimore, and E.G. Ng, A column approximate minimum degree ordering algorithm, ACM Trans. Math. Software, submitted.
8. 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.
9. A. George and J.W.H. Liu, The evolution of the minimum degree ordering algorithm, SIAM Rev., 31 (1989), pp. 1-19.
10. A. George and E. Ng, On the complexity of sparse QR and LU factorization on finite-element matrices, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 849-861.
11. A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
12. J.R. Gilbert, Graph Separator Theorems and Sparse Gaussian Elimination, Ph.D. thesis, Stanford University, 1980.
13. J.R. Gilbert and E. Ng, Predicting structure in nonsymmetric sparse matrix factorizations, in Graph Theory and Sparse Matrix Computation, IMA Vol. Math. Appl. 56, A. George, J.R. Gilbert, and J.W.H. Liu, eds., Springer-Verlag, New York, 1993.
14. J.R. Gilbert and R. Schreiber, Nested dissection with partial pivoting, in Sparse Matrix Symposium 1982: Program and Abstracts, Fairfield Glade, TN, 1982, p. 61.
15. 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, FL, 1998; also available as CISE Tech Report TR-98-016 at ftp://ftp.cise.ufl.edu/cis/tech-reports/tr98/tr98-016.ps.
16. 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, FL, 1998; also available as CISE Tech Report TR-98-016 at ftp://ftp.cise.ufl.edu/cis/tech-reports/tr98/tr98-016.ps.
17. X.S. Li, Sparse Gaussian Elimination on High Performance Computers, Ph.D. thesis, Department of Computer Science, University of California, Berkeley, CA, 1996.
18. A. Pothen and C.-J. Fan, Computing the block triangular form of a sparse matrix, ACM Trans. Math. Software, 16 (1990), pp. 303-324.