Memory Efficient Adaptive Mesh Generation and Implementation of Multigrid Algorithms Using Sierpinski Curves


Contact
Joern.Behrens [ at ] awi.de

Abstract

We will present both underlying ideas and concepts, and first results and experiencesgained within an ongoing project to implement a highly memory efficient version of thegrid generator amatos [BRH+05]. Our focus will be on algorithmic and implemen-tational approaches to realize multigrid algorithms on recursively structured adaptivetriangular grids. The key concept is to use a cell-oriented processing of the grids andspace-filling-curve techniques to get rid of the need to store neighbourship relations onadaptive grids.



Item Type
Conference (Conference paper)
Authors
Divisions
Programs
Publication Status
Published
Event Details
In M. Becker and H. Szczerbicka (ed.), Simulationstechnique -- 19th Symposium in Hannover 2006 of Frontiers in Simulation, SCS Publishing House, Erlangen264..
Eprint ID
16011
Cite as
Bader, M. , Schraufstetter, S. and Behrens, J. (2006): Memory Efficient Adaptive Mesh Generation and Implementation of Multigrid Algorithms Using Sierpinski Curves , In M. Becker and H. Szczerbicka (ed.), Simulationstechnique -- 19th Symposium in Hannover 2006 of Frontiers in Simulation, SCS Publishing House, Erlangen264. .


Download
[thumbnail of Fulltext]
Preview
PDF (Fulltext)
Bad2006a.pdf

Download (98kB) | Preview
Cite this document as:

Share
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Research Platforms
N/A

Campaigns
N/A


Actions
Edit Item Edit Item