## Version 1.1.0

26th October 2012

Recent Changes

Let $A$ be an $n×n$ sparse matrix with a symmetric sparsity pattern. Given the sparsity pattern of $A$, this subroutine uses a variant of Sloan’s method to calculate a symmetric permutation that aims to reduce the proﬁle and wavefront of $A$. Alternatively, the Reverse Cuthill-McKee (RCM) method may be requested to reduce the bandwidth, or the user may request an ordering for the rows of $A$ that is eﬃcient when used with a row-by-row frontal solver (for example, equation entry to MA42).