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

Bader, M.; Schraufstetfer, S.; Vigh, C.A.; Behrens, J.

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

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

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bader, M., Schraufstetfer, S., Vigh, C., & Behrens, J. (2008). Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves. International Journal of Computational Science and Engineering, 4(1), 12-21.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0018-2777-2

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.