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	readme
for	overview of Sparse 1.3 and timing results

file	timing.txt
for	Sparse 1.3 Timing Comparisons

# Sparse source

file	spallocate.c

file	spbuild.c

file	spconfig.h

file	spdefs.h

file	spfactor.c

file	spmatrix.h

file	spsolve.c

file	spfortran.c

file	spoutput.c

file	sprevision

file	sptest.c

file	sputils.c

file	makefile
for	UNIX makefile

file	make.com
for	VMS makefile


# Sparse User's Guide

file	spdoc
for	line printer version

file	spdoc.ms
for	source file in troff -ms


# Test matrices

file	mat0

file	mat1

file	mat2

file	mat3

file	mat5