Design of a recursive, shape controlling mesh generator

Abstract

Abstract A recursive, shape controlling triangulation method is described. The method is designed to produce a labelling which implies reduced fill in the solution of (finite element) equations assembled from such a triangulation and allows simple implementation of a nested disection algorithm for irregular domains. This approach saves a substantial amount of time usually spent on discovering a suitable relabelling of the triangulation. In addition, the matrix of the resulting system is then endowed with a recursive doubly bordered block diagonal form. This allows us to develop a recursive parallel bisection method for the solution of the system of equations.