## Version 5.2.0

2nd August 2013

Recent Changes

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 a matrix $B={\left\{{b}_{ij}\right\}}_{n×r}$, this subroutine solves the system $Ax=b$ or the system $AX=B$ . The matrix $A$ need not be deﬁnite. There is an option for iterative reﬁnement.