A new adaptive mesh refinement data structure with an application to detonation

Authors:
Hua Ji;Fue-Sang Lien;Eugene Yee
Affiliations:
Waterloo CFD Engineering Consulting Inc., Waterloo, ON, Canada N2T 2N7;Department of Mechanical Engineering, University of Waterloo, Waterloo, ON, Canada N2L 3G1;Defence R&D Canada - Suffield, P.O. Box 4000, Medicine Hat, AB, Canada T1A 8K6
Venue:
Journal of Computational Physics
Year:
2010

Citing 6
Cited 2

An improvement of fractional step methods for the incompressible Navier-Stokes equations

Journal of Computational Physics
An alternative to unstructured grids for computing gas dynamic flows around arbitrarily complex two-dimensional bodies

Computers and Fluids
On the Choice of Wavespeeds for the HLLC Riemann Solver

SIAM Journal on Scientific Computing
Fully threaded tree algorithms for adaptive refinement fluid dynamics simulations

Journal of Computational Physics
Querying multi-dimensional data indexed using the Hilbert space-filling curve

ACM SIGMOD Record
Local adaptive mesh refinement for shock hydrodynamics

Journal of Computational Physics

Towards adaptive kinetic-fluid simulations of weakly ionized plasmas

Journal of Computational Physics
High Resolution Sharp Computational Methods for Elliptic and Parabolic Problems in Complex Geometries

Journal of Scientific Computing

Quantified Score

Hi-index	31.45

Visualization

Abstract

A new Cell-based Structured Adaptive Mesh Refinement (CSAMR) data structure is developed. In our CSAMR data structure, Cartesian-like indices are used to identify each cell. With these stored indices, the information on the parent, children and neighbors of a given cell can be accessed simply and efficiently. Owing to the usage of these indices, the computer memory required for storage of the proposed AMR data structure is only 58 word per cell, in contrast to the conventional oct-tree [P. MacNeice, K.M. Olson, C. Mobary, R. deFainchtein, C. Packer, PARAMESH: a parallel adaptive mesh refinement community toolkit, Comput. Phys. Commun. 330 (2000) 126] and the fully threaded tree (FTT) [A.M. Khokhlov, Fully threaded tree algorithms for adaptive mesh fluid dynamics simulations, J. Comput. Phys. 143 (1998) 519] data structures which require, respectively, 19 and 238 words per cell for storage of the connectivity information. Because the connectivity information (e.g., parent, children and neighbors) of a cell in our proposed AMR data structure can be accessed using only the cell indices, a tree structure which was required in previous approaches for the organization of the AMR data is no longer needed for this new data structure. Instead, a much simpler hash table structure is used to maintain the AMR data, with the entry keys in the hash table obtained directly from the explicitly stored cell indices. The proposed AMR data structure simplifies the implementation and parallelization of an AMR code. Two three-dimensional test cases are used to illustrate and evaluate the computational performance of the new CSAMR data structure.