A simple algorithm for adaptive refinement of tetrahedral meshes combined with edge elements

A simple algorithm yielding unique face subdivision patterns of locally refined tetrahedral elements by the Delaunay tessellation process is presented. Due to the numerous advantages of edge elements, the algorithm is combined with the magnetostatic edge element computer code. A comparative analysis of four different error estimates used to locate elements for refinement, including a new one suitable for edge elements, is described. The performance of the proposed algorithm and the effectiveness of the error estimates are demonstrated by means of three-dimensional test problems.<
>