Adaptive Mesh Refinement algorithm based on dual trees for cells and faces for multiphase compressible flows
Abstract
A novel adaptive mesh refinement method is proposed. The novelty of the method lies in using a dual data structure with two trees: A classical one for the computational cells and an extra one dedicated to computational cell faces. This new dual structure simplifies the algorithm, making the method easy to implement. It results in an efficient adaptive mesh refinement method that preserves an acceptable memory cost. This adaptive mesh refinement method is then applied to compressible multiphase flows in the framework of diffuse-interface methods. Efficiency of the method is demonstrated thanks to computational results for different applications: Transport, shock tube, surface-tension flow, cavitation and water-droplet atomization, in one and multi-dimensions. The test cases are performed with the open-source code ECOGEN and with quantitative comparisons regarding non-adaptive mesh refinement methods to analyze benefits. A discussion specific to parallel computing is also presented.
Additional Information
© 2019 Elsevier Inc. Received 8 May 2018, Revised 11 March 2019, Accepted 13 March 2019, Available online 19 March 2019.Additional details
- Eprint ID
- 93975
- DOI
- 10.1016/j.jcp.2019.03.011
- Resolver ID
- CaltechAUTHORS:20190320-072913494
- Created
-
2019-03-20Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field