@Article{NMTMA-2-1,
author = {},
title = {A Parallel Algorithm for Adaptive Local Refinement of Tetrahedral Meshes Using Bisection},
journal = {Numerical Mathematics: Theory, Methods and Applications},
year = {2009},
volume = {2},
number = {1},
pages = {65--89},
abstract = {<p style="text-align: justify;">Local mesh refinement is one of the key steps in the
implementations of adaptive finite element methods. This paper
presents a parallel algorithm for distributed memory parallel
computers for adaptive local refinement of tetrahedral meshes using
bisection. This algorithm is used in PHG, Parallel
Hierarchical Grid (http://lsec.cc.ac.cn/phg/), a toolbox
under active development for parallel adaptive finite element
solutions of partial differential equations. The algorithm proposed
is characterized by allowing simultaneous refinement of submeshes to
arbitrary levels before synchronization between submeshes and
without the need of a central coordinator process for managing new
vertices. Using the concept of canonical refinement, a simple
proof of the independence of the resulting mesh on the mesh
partitioning is given, which is useful in better understanding the
behaviour of the bisectioning refinement procedure.</p>},
issn = {2079-7338},
doi = {https://doi.org/2009-NMTMA-6016},
url = {https://global-sci.com/article/90743/a-parallel-algorithm-for-adaptive-local-refinement-of-tetrahedral-meshes-using-bisection}
}