 | Abstracts for the Conference on
Grid Adaptivity in Computational PDEs,
Edinburgh, July 96 |  Next |
| Previous |
 Index |
Different coarse-to-fine interpolants and their performance
in DD and MG methods on unstructured grids
J Zou¹ , T F Chan & S Go
¹Department of Mathematics,
The Chinese University of Hong Kong,
Shatin, N.T., Hong Kong.
E-mail: zou@math.cuhk.hk
Abstract
Multilevel domain decomposition and multigrid methods depend on good
interpolation operators to transfer information from one level to another.
In unstructured meshes, the grid hierachy can allow general coarse grids
whose boundaries may be non-matching to the boundary of the fine grid,
so special treatments are needed to implement different types of boundary
conditions. In this talk, we will discuss some algorithms to generate
coarse grids for unstructured meshes, and then propose several different
variations
of coarse-to-fine interpolations to correctly handle boundary conditions in
such cases. Finally, some numerical results for domain decomposition and
multigrid methods on unstructured grids will be given.
Last modified Fri Jun 21 19:19:18 GB-Eire 1996
(DBD)