Version 1.1.0
26th October 2012- User documentation
- Recent Changes
-
Code Download
- Single
- Double
MC61: Straightforward interface to MC60
Let \(\mathbf{A}\) be an \(n \times n\) sparse matrix with a symmetric sparsity pattern. Given the sparsity pattern of \(\mathbf{A}\), this subroutine uses a variant of Sloan’s method to calculate a symmetric permutation that aims to reduce the profile and wavefront of \(\mathbf{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 \(\mathbf{A}\) that is efficient when used with a row-by-row frontal solver (for example, equation entry to MA42
).
MC61
provides the user with a straightforward interface to the MC60
package when detailed control of the steps in constructing a symmetric permutation or row ordering is not required.