A generic grid interface for parallel and adaptive scientific computing. Part I: abstract framework
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 hierarc...
Saved in:
| Published in | Computing Vol. 82; no. 2-3; pp. 103 - 119 |
|---|---|
| Main Authors | , , , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Vienna
Springer Vienna
01.07.2008
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0010-485X 1436-5057 |
| DOI | 10.1007/s00607-008-0003-x |
Cover
| Summary: | 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). |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0010-485X 1436-5057 |
| DOI: | 10.1007/s00607-008-0003-x |