Space tree structures for PDE software. (English) Zbl 1056.65107

Sloot, Peter M. A. (ed.) et al., Computational science - ICCS 2002. 2nd international conference, Amsterdam, the Netherlands, April. 21–24, 2002. Proceedings. Part 3. Berlin: Springer (ISBN 3-540-43594-8). Lect. Notes Comput. Sci. 2331, 662-671 (2002).
Summary: We study the potential of space trees (boundary extended octrees for an arbitrary number of dimensions) in the context of software for the numerical solution of partial differential equations (PDEs). The main advantage of the approach presented is the fact that the underlying geometry’s resolution can be decoupled from the computational grid’s resolution, although both are organized within the same data structure. This allows us to solve the PDE on a quite coarse orthogonal grid at an accuracy corresponding to a much finer resolution.
We show how fast (multigrid) solvers based on the nested dissection principle can be directly implemented on a space tree. Furthermore, we discuss the use of this hierarchical concept as the common data basis for the partitioned solution of coupled problems like fluid-structure interactions, e.g., and we address its suitability for an integration of simulation software.
For the entire collection see [Zbl 0988.68770].


65N22 Numerical solution of discretized equations for boundary value problems involving PDEs
65Y15 Packaged methods for numerical algorithms
65N55 Multigrid methods; domain decomposition for boundary value problems involving PDEs
65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
Full Text: Link