Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves

Abstract

We will present an approach to numerical simulation on recursively structured adaptive discretisation grids. The respective grid generation process is based on recursive bisection of triangles along marked edges. The resulting refinement tree is sequentialised according to a Sierpinski space-filling curve, which leads to both minimal memory requirements and inherently cache-efficient processing schemes. The locality properties induced by the space-filling curve are even retained throughout adaptive refinement of the grid. We demonstrate the efficiency of the approach by implementing a multilevel-preconditioned conjugate gradient solver for a simple, yet adaptive, test problem: solving Poisson’s equation on a re-entrant corner problem.

DOI: 10.1504/IJCSE.2008.021108

Extracted Key Phrases

15 Figures and Tables

Cite this paper

@article{Bader2008MemoryEA, title={Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves}, author={Michael Bader and Stefanie Schraufstetter and Csaba Vigh and J{\"{o}rn Behrens}, journal={IJCSE}, year={2008}, volume={4}, pages={12-21} }