BACK TO INDEX

Publications about 'Sparse matrix ordering' on CSC

Articles in journal or book chapters

1. J. Schulze. Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT Numerical Mathematics, 41(4):800-841, 2001.



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



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



4. P. R. Amestoy, T. A. Davis, and I. S. Duff. An approximate minimum degree ordering algorithm. SIAM Journal on Matrix Analysis and Applications, 17(4):886-905, 1996. Keyword(s): Sparse matrix ordering, Minimum degree algorithm.



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



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

Internal reports

1. A. Gupta. Fast and effective algorithms for graph partitioning and sparse matrix ordering. Technical report RC 20496 (90799), IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY, USA, 1996.

Manuals, booklets

1. F. Pellegrini. SCOTCH 5.1 User's Guide. Laboratoire Bordelais de Recherche en Informatique (LaBRI), 2008. Keyword(s): Graph partitioning, Sparse matrix ordering, Nested dissection.



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



3. B. Hendrickson and R. Leland. The Chaco user's guide, version 2.0. Sandia National Laboratories, Alburquerque, NM, 87185, 1995. 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.