BACK TO INDEX

Publications in year 1998 on CSC

Articles in journal or book chapters

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



2. B. Hendrickson and E. Rothberg. Improving the run time and quality of nested dissection ordering. SIAM Journal on Scientific Computing, 20(2):468-489, 1998. Keyword(s): Sparse matrix ordering, Nested dissection, Minimum degree algorithm, Minimum degree ordering, Graph algorithms, Graph partitioning.



3. J. H. Reif. Efficient approximate solution of sparse linear systems. Computers and Mathematics with Applications, 36(9):37-58, November 1998.

Manuals, booklets

1. G. Karypis and V. Kumar. MeTiS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices version 4.0. University of Minnesota, Department of Comp. Sci. and Eng., Army HPC Research Center, Minneapolis, 1998. Keyword(s): Graph partitioning, Sparse matrix ordering, Nested dissection.

BACK TO INDEX

---

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