Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves
by M. Bader, S. Schraufstetter, C.A. Vigh, J. Behrens
International Journal of Computational Science and Engineering (IJCSE), Vol. 4, No. 1, 2008

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.

Online publication date: Tue, 04-Nov-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com