BACK TO INDEX

Publications of W.-H. Liu on CSC

Books and proceedings

1. A. George and J. W. H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, N.J., 1981.

Articles in journal or book chapters

1. S. C. Eisenstat and J. W. H. Liu. A tree-based dataflow model for the unsymmetric multifrontal method. Electronic Transactions on Numerical Analysis, 21:1-19, 2005.



2. S. C. Eisenstat and J. W. H. Liu. The theory of elimination trees for sparse unsymmetric matrices. SIAM Journal on Matrix Analysis and Applications, 26(3):686-705, 2005.



3. 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 Journal on Matrix Analysis and Applications, 20(3):720-755, 1999.



4. C. Ashcraft and J. W. H. Liu. Robust ordering of sparse matrices using multisection. SIAM Journal on Matrix Analysis and Applications, 19(3):816-832, 1998. Keyword(s): Sparse matrix ordering, Minimum degree algorithm, Nested dissection.



5. C. Ashcraft and J. W. H. Liu. Using domain decomposition to find graph bisectors. BIT, 37(3):506-534, 1997.



6. M. V. Bhat, W. G. Habashi, J. W. H. Liu, V. N. Nguyen, and M. F. Peeters. A note on nested dissection for rectangular grids. SIAM Journal on Matrix Analysis and Applications, 14(1):253-258, 1993.



7. J. R. Gilbert and J. W. H. Liu. Elimination structures for unsymmetric sparse $LU$ factors. SIAM Journal on Matrix Analysis and Applications, 14(2):334-352, 1993.



8. J. W. H. Liu, E. G. Ng, and B. W. Peyton. On finding supernodes for sparse matrix computations. SIAM Journal on Matrix Analysis and Applications, 14(1):242-252, 1993.



9. J. W. H. Liu. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Review, 34(1):82-109, 1992.



10. J. W. H. Liu. The role of elimination trees in sparse factorization. SIAM Journal on Matrix Analysis and Applications, 11(1):134-172, 1990. Keyword(s): Elimination tree, Cholesky factorization, Sparse matrix ordering, Symbolic factorization.



11. A. George and J. W. H. Liu. The evolution of the minimum degree ordering algorithm. SIAM Review, 31(1):1-19, 1989. Keyword(s): Sparse matrix ordering, Minimum degree algorithm, Computational complexity.



12. A. George, J. W. H. Liu, and E. Ng. Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Computing, 10(3):287-298, 1989. Keyword(s): Parallel computing, Cholesky factorization, Task scheduling, Subtree-to-subcube mapping.



13. J. W. H. Liu. The minimum degree ordering with constraints. SIAM Journal on Scientific and Statistical Computing, 10(6):1136-1145, 1989. Keyword(s): Minimum degree ordering.



14. J. W. H. Liu. Equivalent sparse matrix reordering by elimination tree rotations. SIAM Journal on Scientific and Statistical Computing, 9(3):424-444, 1988. Keyword(s): Multifrontal method, Elimination tree, Equivalent reordering, Out-of-core factorization, Cholesky factorization.



15. J. W. H. Liu. A compact row storage scheme for Cholesky factors using elimination trees. ACM Transactions on Mathematical Software, 12(2):127-148, 1986.



16. J. W. H. Liu. On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Transactions on Mathematical Software, 12(3):249-264, 1986.



17. J. W. H. Liu. Modification of the minimum-degree algorithm by multiple elimination. ACM Transactions on Mathematical Software, 11(2):141-153, 1985.



18. A. George and J. W. H. Liu. A fast implementation of the minimum degree algorithm using quotient graphs. ACM Transactions on Mathematical Software, 6(3):337-358, 1980.



19. A. George and J. W. H. Liu. A minimal storage implementation of the minimum degree algorithm. SIAM Journal on Numerical Analysis, 17(2):282-299, 1980.



20. A. George and J. W. H. Liu. An automatic nested dissection algorithm for irregular finite element problems. SIAM Journal on Numerical Analysis, 15(5):1053-1069, 1978.



21. W.-H. Liu and A. H. Sherman. Comparative analysis of the Cuthill-McKee and the Reverse Cuthill--McKee ordering algorithms for sparse matrices. SIAM Journal on Numerical Analysis, 13(2):198-213, 1976.

Internal reports

1. C. Ashcraft and J. W. H. Liu. A partition improvement algorithm for generalized nested dissection. Technical report BCSTECH-94-020, Boeing Computer Services, Seattle, WA, USA, 1996.

BACK TO INDEX

---

Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.