An algorithm for adaptive mesh refinement in \(n\) dimensions (Q1377291)

This paper deals with local adaptive mesh refinement in \(n\) dimensions in the context of finite element calculations. The given fast algorithm is based on simplex bisection which simplifies bookkeeping of the neighbour graph. A program in C++ is also presented. Notice that bisection refinement leads to certain restrictions on the initial, coarsest grid. The author formulates and proves a criterion for the applicability of the described mesh refinement procedure.