An Approximate Minimal Elimination Ordering Scheme
Matrix ordering is a key technique when applying Cholesky factorization method to solving sparse symmetric positive definite system Ax = b. In view of some known minimal elimination ordering methods, an efficient heuristic approximate minimal elimination ordering scheme is proposed, which has the total running time of O(n+m). It is noteworthy that the algorithm can not only find a good ordering efficiently, but also achieve the result of symbolic factorization simultaneously.
L. Yao et al., "An Approximate Minimal Elimination Ordering Scheme", Advanced Materials Research, Vols. 268-270, pp. 1533-1536, 2011