SPARSE 1.3

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

Developer

Kenneth Kundert and Alberto Sangiovanni-Vincentelli, University of California, Berkeley

Comments and questions may be addressed to

file	sparse/readme
for	overview of Sparse 1.3 and timing results

file	sparse/timing.txt
for	Sparse 1.3 Timing Comparisons

# Sparse source

file	sparse/spallocate.c

file	sparse/spbuild.c

file	sparse/spconfig.h

file	sparse/spdefs.h

file	sparse/spfactor.c

file	sparse/spmatrix.h

file	sparse/spsolve.c

file	sparse/spfortran.c

file	sparse/spoutput.c

file	sparse/sprevision

file	sparse/sptest.c

file	sparse/sputils.c

file	sparse/makefile
for	UNIX makefile

file	sparse/make.com
for	VMS makefile


# Sparse User's Guide

file	sparse/spdoc
for	line printer version

file	sparse/spdoc.ms
for	source file in troff -ms


# Test matrices

file	sparse/mat0

file	sparse/mat1

file	sparse/mat2

file	sparse/mat3

file	sparse/mat5