A Hash Data Structure for Adaptive PDE – Solvers Based on Discontinuous Galerkin Discretizations

Adaptive multiscale methods are among the most effective techniques for the numerical solution of partial differential equations. Efficient grid management is an important task in these solvers. In this paper we focus on this problem for Discontinuous Galerkin discretization methods in 2 and 3 spatial dimensions and present a data structure for handling adaptive grids of different cell types in a unified approach. Instead of tree-based techniques where connectivity is stored via pointers, we associate each cell that arises in the refinement hierarchy with a cell identifier, and construct algorithms that establish hierarchical and spatial connectivity. By means of bitwise operations, the complexity of the connectivity algorithms can be bounded independent of the level. The grid is represented by a hash table which results in a low-memory data structure and ensures fast access to cell data. The spatial connectivity algorithm also supports the application of quadrature rules for face integrals that occur in Discontinuous Galerkin discretizations. The concept allows to implement Discontinuous Galerkin methods largely independent of spatial dimension and cell type. We demonstrate this by outlining how typical algorithmic tasks that arise in these implementations can be performed with our data structure.

[1]  Wolfgang Dahmen,et al.  Multilevel preconditioners for the interior penalty discontinuous Galerkin method II- Quantitative studies , 2008 .

[2]  Michael Griebel,et al.  Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves , 1999, Parallel Comput..

[3]  S. Rebay,et al.  High-Order Accurate Discontinuous Finite Element Solution of the 2D Euler Equations , 1997 .

[4]  Ralf Massjung.  An hp-error estimate for an unfitted Discontinuous Galerkin Method applied to elliptic interface problems , 2009 .

[5]  Bud E. Smith,et al.  Programming the Intel 80386 , 1987 .

[6]  F. Gyorgy,et al.  Rendering and managing spherical data with sphere quadtrees , 1990, Proceedings of the First IEEE Conference on Visualization: Visualization `90.

[7]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[8]  Peter Bastian,et al.  Parallele adaptive Mehrgitterverfahren , 1994 .

[9]  Shimon Peter Vingron.  Switching Theory: Insight Through Predicate Logic , 2010 .

[10]  Hanan Samet,et al.  Navigating through triangle meshes implemented as linear quadtrees , 2000, TOGS.

[11]  Fritz Keinert,et al.  Wavelets and Multiwavelets , 2003 .

[12]  Wolfgang Dahmen,et al.  A Multilevel Preconditioner for the Interior Penalty Discontinuous Galerkin Method , 2008, SIAM J. Numer. Anal..

[13]  W. Dahmen.  Wavelet and multiscale methods for operator equations , 1997, Acta Numerica.

[14]  Philippe G. Ciarlet,et al.  The finite element method for elliptic problems , 2002, Classics in applied mathematics.

[15]  J. Taylor,et al.  Switching and finite automata theory, 2nd ed. , 1980, Proceedings of the IEEE.

[16]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[17]  Kolja Brix,et al.  Parallelisation of Multiscale-Based Grid Adaptation using Space-Filling Curves , 2009 .

[18]  Hanan Samet,et al.  Constant-time neighbor finding in hierarchical tetrahedral meshes , 2001, Proceedings International Conference on Shape Modeling and Applications.

[19]  J. Bey,et al.  Tetrahedral grid refinement , 1995, Computing.

[20]  A. Schmidt,et al.  Design of Adaptive Finite Element Software , 2005 .

[21]  Chi-Wang Shu.  Discontinuous Galerkin Methods , 2010 .

[22]  G. C. Shephard,et al.  Convex Polytopes , 1969, The Mathematical Gazette.

[23]  S. Seshu,et al.  Introduction to the theory of finite-state machines , 1963 .

[24]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[25]  Douglas N. Arnold,et al.  Unified Analysis of Discontinuous Galerkin Methods for Elliptic Problems , 2001, SIAM J. Numer. Anal..

[26]  Gerhard Zumbusch,et al.  Parallel Multilevel Methods , 2003 .

[27]  Chi-Wang Shu,et al.  Runge–Kutta Discontinuous Galerkin Methods for Convection-Dominated Problems , 2001, J. Sci. Comput..

[28]  Jürgen Bey,et al.  Simplicial grid refinement: on Freudenthal's algorithm and the optimal number of congruence classes , 2000, Numerische Mathematik.