## Version 1.2.0

To solve a sparse unsymmetric system of linear equations. Given an unsymmetric square sparse matrix $A$ of order $n$ and an $n$-vector $B$, this subroutine solves the system $Ax=b$ or ${A}^{T}x=b$. The method used is a parallel direct method based on a sparse multifrontal variant of Gaussian elimination. An initial ordering for the pivotal sequence is chosen using the pattern of the matrix $A$ + ${A}^{T}$ and is later modiﬁed for reasons of numerical stability. Thus this code performs best on matrices whose pattern is symmetric, or nearly so. For symmetric sparse matrices or for very unsymmetric and very sparse matrices, other software might be more appropriate (for example, MA57 or MA48).