home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!ogicse!emory!swrinde!cs.utexas.edu!zaphod.mps.ohio-state.edu!caen!takriti
- From: takriti@engin.umich.edu (samer Takriti)
- Newsgroups: sci.math.num-analysis
- Subject: Re: Help , Sparse matrix inversion
- Keywords: matrix,sparse,inverse
- Message-ID: <1juf4pINNgjb@srvr1.engin.umich.edu>
- Date: 24 Jan 93 16:12:09 GMT
- Article-I.D.: srvr1.1juf4pINNgjb
- References: <1993Jan21.125609.27784@rdg.dec.com>
- Distribution: world
- Organization: University of Michigan Engineering, Ann Arbor
- Lines: 28
- NNTP-Posting-Host: fly.engin.umich.edu
-
- In article <1993Jan21.125609.27784@rdg.dec.com> shaulz@jeremy.enet.dec.com () writes:
- >
- >
- >Hi!
- >I am looking for an efficient algorithms for finding
- > the inverse of sparse matrix.
- >The matrix has the following structure :
- >
- > xxxxxx00000...00000xxxxxx0000...000
- > 0xxxxxx00000...00000xxxxxx0000...00
- > 00xxxxxx00000...00000xxxxxx0000...0
- > . .
- > . .
- > . .
- > xxxxxx00000...00000xxxxxx0000...000
- > 0xxxxxx00000...00000xxxxxx0000...00
- > 00xxxxxx00000...00000xxxxxx0000...0
- >
- >I looked in Numerical Recipes with no result.
- >I will appreciate any references to code/algorithms.
- >
- >Thanks
- > Shaul.
-
- You may want to try SaprcePack. You can get it from Netlib. I think though, that most
- of the algorithms of SparcePack are for positive-definite symmetric matrices.
- Hope this help.
- -Samer
-