Atlas home || Conferences | Abstracts | about Atlas

New Zealand Mathematics Colloquium 1999
July 6-9, 1999
Department of Mathematics and Statistics, University of Canterbury
Christchurch, New Zealand

Organizers
Doris Barnard, Therese Boustead, Chris Price, Bruce Robson, Gunter Steinke, Graeme Wake, Allan Willms

View Abstracts
Conference Homepage

Parallel Algorithms for Singularly Perturbed Problems
by
Igor Boglaev
Massey University

We present and analyse finite difference domain decomposition algorithms for solving singularly perturbed elliptic and parabolic problems based on special piecewise equidistant meshes. These meshes allow us to decompose computational domains into subdomains outside boundary layers and inside them as well, and possess load balancing. This property is very important for implementation of the iterative algorithms on parallel computers, since it avoids loss of efficiency due to one processor being idle. Our purpose is to construct and analyse domain decomposition algorithms based on decomposition of boundary layers, which are suitable for parallel computing. Numerical experiments show that it is possible to use just few iterations of the domain decomposition algorithms and still maintain a stable approximation.

Date received: February 1, 1999

Copyright © 1999 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cacc-06.