## Version 2.1.0

Given the sparsity pattern of a symmetric matrix $A$, MC47 uses an approximate minimum degree algorithm to compute a pivot order that is eﬃcient when used with a sparse Cholesky solver. MC47 optionally allows for the eﬃcient handling of dense or almost dense rows of $A$. At each step, the pivot selected is the one that minimizes an upper-bound on the (external) degree. A permutation corresponding to this ordering is returned, together with information that may assist in the subsequent numerical factorization of the matrix.