![]() |
Edit Item |
General Information:
Citation:
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.
.
Cite this page as:
hdl:10013/epic.26037
Contact Email:
Download:
|
PDF (Fulltext)
Bad2006a.pdf Download (95Kb) | Preview |
|
|
Cite this document as:
|
||
Supplementary Information:
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.
Further Details:
Item Type:
Conference
Authors:
Divisions:
Programs:
Eprint ID:
16011


