<urc>
<url>http://www.netlib.org/sparse/index.html
<title>SPARSE
<version>1.3
<abstract>
SPARSE consists of a set of C procedures for solving large sparse
real or complex linear systems. Besides being able to solve linear
systems, it solves transposed systems, finds determinants, and
estimates errors due to ill-conditioning in the system of equations
and instability in the computations. SPARSE does not require
symmetry and is able to perform numerical pivoting (either diagonal
or complete) to avoid unnecessary error in the solution. It was
originally written for use in circuit simulators and is particularly apt
at handling node- and modified-node admittance matrices.
<reference>
     Kenneth Kundert, Sparse Matrix Techniques, in Circuit
     Analysis, Simulation and Design, Albert Ruehli (Ed.),
     North-Holland, 1986
<author>
     Kenneth Kundert and Alberto Sangiovanni-Vincentelli,
     University of California, Berkeley
<contact>sparse@ic.berkeley.edu
<keywords>numerical library; sparse linear systems
<category>numerical-linalg
</urc>