A new search method for domain decomposition for ODEs
Using singular perturbation and artificial intelligence techniques for domain decomposition for ordinary differential equations (ODEs) has proven to be a successful method. In the new method we define a search space which is stretched on the reduced solutions. The space is represented by a B-tree. The object of the search is to construct an acceptable path that traverses the space from one end of the boundary to the other end of the boundary. Two search strategies, DFS search and backtrack, are used in the search process. The search method is implemented in Smalltalk, an object oriented programming environment.
Year of publication: |
1994
|
---|---|
Authors: | Li, Peiyuan ; Peskin, Richard L. |
Published in: |
Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 36.1994, 4, p. 457-466
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Domain decomposition for singular perturbation PDEs
Li, Peiyuan, (1994)
-
Anatomy of AGNES: an automatic generator of numerical equation solutions
Kowalski, A. Daniel, (1989)
-
Smalltalk — the next generation scientific computing interface?
Peskin, Richard L., (1989)
- More ...