3D Adaptive Central Schemes: part I Algorithms for Assembling the Dual Mesh
For researchers in computational fluid dynamics, this provides an efficient algorithm for handling adaptive Cartesian grids in 3D, though it is an incremental improvement over existing central schemes.
This paper presents a construction technique for staggered dual grids from adaptively refined Cartesian primal grids in 3D using L∞-Voronoi cells, enabling efficient lookup-table-based retrieval of geometric information for second-order finite volume schemes. The method reduces computational effort compared to established approaches.
Central schemes are frequently used for incompressible and compressible flow calculations. The present paper is the first in a forthcoming series where a new approach to a 2nd order accurate Finite Volume scheme operating on cartesian grids is discussed. Here we start with an adaptively refined cartesian primal grid in 3D and present a construction technique for the staggered dual grid based on $L^{\infty}$-Voronoi cells. The local refinement constellation on the primal grid leads to a finite number of uniquely defined local patterns on a primal cell. Assembling adjacent local patterns forms the dual grid. All local patterns can be analysed in advance. Later, running the numerical scheme on staggered grids, all necessary geometric information can instantly be retrieved from lookup-tables. The new scheme is compared to established ones in terms of algorithmical complexity and computational effort.