Abstract
We give a mathematically rigorous definition of a grid for algorithms solving partial differential equations. Unlike previous approaches (Benger 2005, PhD thesis; Berti 2000, PhD thesis), our grids have a hierarchical structure. This makes them suitable for geometric multigrid algorithms and hierarchical local grid refinement. The description is also general enough to include geometrically non-conforming grids. The definitions in this article serve as the basis for an implementation of an abstract grid interface as C++ classes in the framework (Bastian et al. 2008, this issue).
References
Bastian P, Blatt M, Dedner A, Engwer C, Klöfkorn R, Kornhuber R, Ohlberger M, Sander O (2008) A generic grid interface for parallel and adaptive scientific computing. Part II: Implementation and tests in DUNE. Computing (this issue)
Benger W (2005) Visualization of general relativistic tensor fields via a Fiber Bundle Data Model. PhD thesis, Freie Universität Berlin
Berti G (2000) Generic software components for scientific computing. PhD thesis, BTU Cottbus
Botta N, Ionescu C, Linstead C, Klein R (2006) Structuring distributed relation-based computations with SCDRC. Technical report, PIK Report No. 103, Potsdam Institute for Climate Impact Research
DUNE – Distributed and Unified Numerics Environment. http://dune-project.org/
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bastian, P., Blatt, M., Dedner, A. et al. A generic grid interface for parallel and adaptive scientific computing. Part I: abstract framework. Computing 82, 103–119 (2008). https://doi.org/10.1007/s00607-008-0003-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-008-0003-x
Keywords
- DUNE
- Hierarchical grids
- Interface
- Finite elements
- Finite volumes
- Entity complex
- Geometric realization
- Father relation
- Index maps
- Parallelization