BACK TO INDEX

Publications of E. G. Ng on CSC

Articles in journal or book chapters

1. I. Lee, P. Raghavan, and E. G. Ng. Effective preconditioning through ordering interleaved with incomplete factorization. SIAM Journal on Matrix Analysis and Applications, 27(4):1069-1088, 2006.



2. E. G. Ng, B. W. Peyton, and P. Raghavan. A blocked incomplete Cholesky preconditioner for hierarchical-memory computers. In D. R. Kincaid and A. C. Elster, editors, Iterative methods in scientific computation IV, volume 5 of IMACS Series in Computational Applied Mathematics, pages 211-222. IMACS, New Brunswick, NJ, USA, 1999.



3. 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.



4. M. T. Heath, E. Ng, and B. W. Peyton. Parallel algorithms for sparse linear systems. SIAM Review, 33(3):420-460, 1991.



5. G. A. Geist and E. G. Ng. Task scheduling for parallel sparse Cholesky factorization. International Journal of Parallel Programming, 18(4):291-314, 1989. Keyword(s): Parallel computing, Cholesky factorization, Task scheduling, Subtree-to-subcube mapping.



6. 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.

BACK TO INDEX

---

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