The full domain partition facilitates the parallelization of adaptive refinement. Each processor treats its grid exactly like the sequential algorithm, but uses zero as the error estimate in triangles not in its partition. The processors exchange grid information after the refinement is complete to maintain compatibility and degree restrictions across interprocessor boundaries.
Mitchell, W.F., Parallel Adaptive Multilevel Methods with Full Domain Partitions , App. Num. Anal. and Comp. Math., 1, (2004), pp. 36-48. ( gzipped postscript, 286k)
Mitchell, W.F., Adaptive Grid Refinement and Multigrid on Cluster Computers, Proceedings of the 15th International Parallel and Distributed Processing Symposium, IEEE Computer Society Press, 2001. ( gzipped postscript, 200k)
Mitchell, W.F., The Full Domain Partition Approach to Parallel Adaptive Refinement, IMA Volumes in Mathematics and its Applications, 113, Springer-Verlag, 1998, pp. 151-162. Volume devoted to the IMA Workshop on Grid Generation and Adaptive Algorithms. ( gzipped postscript, 138k)
Back to PHAML home page
Last change to this page: April 3, 2007 Date this page created: April 2, 2007 Home Page