A new adaptive mesh refinement data structure with an application to detonation (Q613408): Difference between revisions

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 \(\frac 58\) word per cell, in contrast to the conventional oct-tree of \textit{P. MacNeice, K. M. Olson, C. Mobarry, R. de Fainchtein} and \textit{C. Packer}, [Comput. Phys. Commun. 126, No.3, 330--354 (2000; Zbl 0953.65088)] and the fully threaded tree (FTT) of \textit{A. M. Khokhlov} [J. Comput. Phys. 143, No.2, 519--543 (1998; Zbl 0934.76057)] data structures which require, respectively, 19 and \(2 \frac 38\) words per cell for the 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.