# Are there any specialized methods available for solving structurally symmetric sparse linear systems?

When solving $Ax=b$, prior knowledge about $A$'s structure can help in designing an efficient solver which exploits this information (e.g conjugate gradient method is to be used when $A$ is symmetric and is preferable to GMRES when we know $A$ is so )

For the set of non-linear equations I am working with, I am using the Newton-Raphson method for its solution. The Jacobian ($A$) of NR for every iteration, turns out to be sparse and also symmetric in its sparsity pattern for my problem (but not necessarily in its value).

So $a_{ij} \neq 0 \Leftrightarrow a_{ji} \neq 0$

Is there a class of methods (iterative or direct) which can solve this class of problems efficiently?

If yes, then web-links to any implementations would also be very useful.