Reducing fill-in
A list of algorithms.
Minimum degree (Tinny and Walker, 1967)A suite of sparse matrix packages.
Multiple minimum degree (Liu, 1985)
Approximate minimum degree (Amestoy, et. al., 1996)
Nested dissection (George, 1973)
Multilevel nested dissection routine (Karypis and Kumar, 1998)
Multisection (Ashcraft and Liu, 1998)
Local minimum fill (Tinney and Walker, 1967)http://www.cc.kyushu-u.ac.jp/scp/system/library/WSMP/manual/WSMP-QNA.pdf
http://www.cise.ufl.edu/research/sparse/
UMFPACK is a set of routines for solving unsymmetric sparse linear systems, Ax=b, using the Unsymmetric MultiFrontal method.http://en.wikipedia.org/wiki/Sparse_matrix#Reducing_fill-in
http://www.cise.ufl.edu/research/sparse/umfpack/
