Xref: utzoo comp.lang.c:17820 sci.math.stat:695
Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!pasteur!dogwood.Berkeley.EDU!faustus
From: faustus@dogwood.Berkeley.EDU (Wayne A. Christopher)
Newsgroups: comp.lang.c,sci.math.stat
Subject: Re: Need matrix inversion C routine.
Keywords: C matrix invert
Message-ID: <12784@pasteur.Berkeley.EDU>
Date: 23 Apr 89 21:21:41 GMT
References: <2846@tank.uchicago.edu> <5785@cbnews.ATT.COM> <10087@smoke.BRL.MIL>
Sender: news@pasteur.Berkeley.EDU
Lines: 13

In article <2846@tank.uchicago.edu>, vevea@paideia.uchicago.edu (Jack L. Vevea) writes:
> 	While we're on this subject, I have need of a long, slow matrix
> inversion routine that is at least callable from C.  I say
> "long, slow" because I need something I can apply to matrices with dimension
> in the hundreds, so it must be sensitive to the possibility of rounding
> error, and pick the optimal pivots.

There are a lot of algorithms used to do this sort of thing with sparse
matrices in circuit simulation.  In particular, the Spice 3 circuit
simulator available from Berkeley has a sparse matrix manipulation
package that you could probably use.

	Wayne