ALGORITHMIC ASPECTS OF ADAPTIVE MULTIGRID FINITE-ELEMENT ANALYSIS

This paper describes the algorithmic aspects of a multigrid solver bas ed on the adaptive generation of a sequence of discretizing meshes. No n-uniform discretization is obtained by confining finer meshes to prog ressively smaller subdomains. New meshes are generated through bisecti on refinement according to a local error indicator. A dynamic data str ucture, suitable for C-language implementations, and a technique for i rregular nodes, which simplifies the treatment of interfaces between d ifferent refinement subdomains, are described. Several numerical examp les using bilinear and HC finite elements are presented at the end.