A new search method for domain decomposition for ODEs

✍ Scribed by Peiyuan Li; Richard L. Peskin

• Publisher: Elsevier Science
• Year: 1994
• Tongue: English
• Weight: 661 KB
• Volume: 36
• Category: Article
• ISSN: 0378-4754
• DOI: 10.1016/0378-4754(94)90078-7

✦ Synopsis

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.