Abstract

In this paper, we consider local mesh refinement algorithms and data structures for finite element methods for linear elliptic partial differential equations in the plane. Quadrilateral and triangular are treated in a unified fashion. Because we restrict the local refinement to be regular, the resulting finite element systems are always sparse, and the refinement algorithms can be implemented efficiently, in time proportional to the number of elements.