Scalable Algorithms for Parallel Tree-based Adaptive Mesh Refinement with General Element Types

by   Johannes Holke, et al.

In this thesis, we develop, discuss and implement algorithms for scalable parallel tree-based adaptive mesh refinement (AMR) using space-filling curves (SFCs). We create an AMR framework that works independently of the used element type, such as for example lines, triangles, tetrahedra, quadrilaterals, hexahedra, and prisms. Along with a detailed mathematical discussion, this requires the implementation as a numerical software and its validation, as well as scalability tests on current supercomputers. For triangular and tetrahedral elements (simplices) with red-refinement (1:4 in 2D, 1:8 in 3D), we develop a new SFC index, the tetrahedral Morton index (TM-index). Its construction is similar to the Morton index for quadrilaterals/hexahedra, as it is also based on bitwise interleaving the coordinates of a certain vertex of the simplex, the anchor node.



page 16

page 17

page 20


Coupling parallel adaptive mesh refinement with a nonoverlapping domain decomposition solver

We study the effect of adaptive mesh refinement on a parallel domain dec...

Binarized octree generation for Cartesian adaptive mesh refinement around immersed geometries

We revisit the generation of balanced octrees for adaptive mesh refineme...

Implementation of Polygonal Mesh Refinement in MATLAB

We present a simple and efficient MATLAB implementation of the local ref...

Distributed-Memory Forest-of-Octrees Raycasting

We present an MPI-parallel algorithm for the in-situ visualization of co...

mVEM: A MATLAB Software Package for the Virtual Element Methods

This paper summarizes the development of mVEM, a MATLAB software package...

One machine, one minute, three billion tetrahedra

This paper presents a new scalable parallelization scheme to generate th...

BoxLib with Tiling: An AMR Software Framework

In this paper we introduce a block-structured adaptive mesh refinement (...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.