Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!husc6!rutgers!njin!princeton!phoenix!taipei!hwang
From: hwang@taipei.Princeton.EDU (Jenq-Neng Hwang)
Newsgroups: comp.ai.neural-nets
Subject: Re: guassian elimination on sparce matricies (used as an associative mem)
Keywords: matrix associative memory
Message-ID: <7607@phoenix.Princeton.EDU>
Date: 6 Apr 89 13:50:08 GMT
References: <18331@gatech.edu>
Sender: news@phoenix.Princeton.EDU
Reply-To: hwang@taipei.UUCP (Jenq-Neng Hwang)
Distribution: na
Organization: Princeton University, Princeton NJ
Lines: 11

Instead of using Gaussian elimination type of algorithms for solving the sparse matrices, there
have been row-action methods proposed, which are iterative procedures suitable for solving
linear systems without any structural assumption on sparseness.  One famous example is the
Kaczmarz projection method, which can be used to interpret the dynamic behavior of later stage
of back-propagation learning, has been widely used in image reconstruction applications.
A good tutorial paper is:

Yair Censor, " Row-Action Methods for Huge and Sparse Systems and Their Applications,"
SIAM Review, Vol. 23, No. 4, pp 444-466, October 1981.

J. N. Hwang