Techniques for Parallel Adaptivity
Peter K. Jimack · Computational science, engineering and technology series · 2009
: This paper considers the main algorithmic issues associated with developing parallel mesh adaptivity software for use with tetrahedral-based parallel finite element or finite volume solvers for transient computational mechanics problems in three space dimensions. Issues that are addressed include the use of different parallel data structures, the modification of these data structures when adaptivity occurs and the dynamic maintenance of load-balance in the parallel solver. 1 Introduction Adaptive algorithms are an important feature of almost all state-of-the-art software for computational mechanics and scientific computation. These algorithms can take many forms, the most common being h-refinement (e.g. [25, 33]), prefinement (e.g. [2, 42]) or r-refinement (e.g. [26, 27]), with various combinations of these also possible (e.g. [3, 10, 11]). The overall aim of any adaptive algorithm is to allow a balance to be obtained between accuracy and computational efficiency. In those regions ...