论文部分内容阅读
The minimum local fill(MLF)heuristic computes a fill-reducing permutation for sparse Cholesky factorization.It is generally believed that MLF is very expensive and produces marginally better permutations than the wellknown minimum degree(MD)heuristic.