## Version 3.10.0

2nd September 2016

Recent Changes

• Single
• Double

### MA57 Sparse symmetric system: multifrontal method

To solve a sparse symmetric system of linear equations. Given a sparse symmetric matrix $A={\left\{{a}_{ij}\right\}}_{n×n}$ and an $n$-vector $b$ (or an $n×s$ matrix $B$), this subroutine solves the system $Ax=b$ ($AX=B$). The matrix $A$ need not be deﬁnite.

The multifrontal method is used. It is a direct method based on a sparse variant of Gaussian elimination.

The matrix is optionally prescaled by using a symmetrization of the MC64 scaling. Other ordering options are provided including hooks to MeTiS. The user can avoid additional ﬁll-in to that predicted by the analysis by using static pivoting.