An extended pressure finite element space for two-phase incompressible flows with surface tension
Journal of Computational Physics
A parallel strategy for a level set simulation of droplets moving in a liquid medium
VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids
Journal of Computational Physics
HPCS'09 Proceedings of the 23rd international conference on High Performance Computing Systems and Applications
| Hi-index | 0.02 |
In this paper we analyze a parallel version of a multilevel red/green local refinement algorithm for tetrahedral meshes. The refinement method is similar to the approaches used in the UG-package [UG, http://cox.iwr.uni-heidelberg.de/~ug] and by Bey [Computing, 55 (1995), pp. 355--378; Finite-Volumen- und Mehrgitterverfahren für Elliptische Randwertprobleme, Ph. D. thesis, Universität Tübingen, Tübingen, Germany, 1997]. We introduce a new data distribution format that is very suitable for the parallel multilevel refinement algorithm. This format is called an admissible hierarchical decomposition. We will prove that the application of the parallel refinement algorithm to an input admissible hierarchical decomposition yields an admissible hierarchical decomposition. The analysis shows that the data partitioning between the processors is such that we have a favorable data locality (e.g., parent and children are on the same processor) and at the same time only a small number of copies.