ALGORITHMIC ASPECTS OF ADAPTIVE MULTIGRID FINITE ELEMENT ANALYSIS

This paper describes the algorithmic aspects of a multigrid solver based on the adaptive generation of a sequence of discretizing meshes. Non-uniform discretization is obtained by con ning ner meshes to progres- sively smaller subdomains. New meshes are generated through bisection re nement according to a local error indicator. A dynamic data structure, suitable for C-language implementations, and a technique for irregular nodes, which simpli es the treatment of interfaces between di erent re nement subdomains, are described. Several numerical examples using bilinear and HC nite elements are presented at the end.