A new search method for domain decomposition for ODEs

Peiyuan Li and Richard L. Peskin

Mathematics and Computers in Simulation (MATCOM), 1994, vol. 36, issue 4, 457-466

Abstract: 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.

Date: 1994
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475494900787
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:36:y:1994:i:4:p:457-466

DOI: 10.1016/0378-4754(94)90078-7

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().