Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: notesfiles - hp internal release 1.2; site hplabs.UUCP
Path: utzoo!utcs!lsuc!pesnta!hplabs!iles
From: iles@hplabs.UUCP
Newsgroups: net.math
Subject: Adomian's Approx. Process - info wtd
Message-ID: <7300005@hplabs.UUCP>
Date: Fri, 14-Jun-85 11:24:00 EDT
Article-I.D.: hplabs.7300005
Posted: Fri Jun 14 11:24:00 1985
Date-Received: Sat, 15-Jun-85 21:15:26 EDT
Lines: 19
Nf-ID: #N:hplabs:7300005:000:773
Nf-From: hplabs!iles    Jun 14 07:24:00 1985

I just saw an interesting presentation by Professor Adomian of U. of 
Georgia about his techniques for approximating any series of equations.

Has anyone out there had any experience with his ideas?  I am a little
concerned because there is no general proof claimed which show that
this process works on any system, but he has shown it to be extremely
effective in several thousand "real" physics problems and other
dynamic systems.  

What is interesting is that the algorithm can be applied to *any*
system, PDEs, algebraic operators, sparse matrices, whatever.  It is
also any extremely straightforward process based on a rather clever
idea.

So, if anyone out there has worked with this, I'd appreciate hearing
about it.  Thanks in advance.

Daniel Lieman
hplabs!iles