scholarly journals AMReX: Block-structured adaptive mesh refinement for multiphysics applications

Author(s):  
Weiqun Zhang ◽  
Andrew Myers ◽  
Kevin Gott ◽  
Ann Almgren ◽  
John Bell

Block-structured adaptive mesh refinement (AMR) provides the basis for the temporal and spatial discretization strategy for a number of Exascale Computing Project applications in the areas of accelerator design, additive manufacturing, astrophysics, combustion, cosmology, multiphase flow, and wind plant modeling. AMReX is a software framework that provides a unified infrastructure with the functionality needed for these and other AMR applications to be able to effectively and efficiently utilize machines from laptops to exascale architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving accurate descriptions of different physical processes in complex multiphysics algorithms. AMReX supports algorithms that solve systems of partial differential equations in simple or complex geometries and those that use particles and/or particle–mesh operations to represent component physical processes. In this article, we will discuss the core elements of the AMReX framework such as data containers and iterators as well as several specialized operations to meet the needs of the application projects. In addition, we will highlight the strategy that the AMReX team is pursuing to achieve highly performant code across a range of accelerator-based architectures for a variety of different applications.

2014 ◽  
Vol 74 (12) ◽  
pp. 3217-3227 ◽  
Author(s):  
Anshu Dubey ◽  
Ann Almgren ◽  
John Bell ◽  
Martin Berzins ◽  
Steve Brandt ◽  
...  

2021 ◽  
Vol 11 (21) ◽  
pp. 9879
Author(s):  
Wanjun Xu ◽  
Kang Li ◽  
Zhengyang Geng ◽  
Mingjie Zhang ◽  
Jiangang Yang

Nonuniform mesh is beneficial to reduce computational cost and improve the resolution of the interest area. In the paper, a cell-based adaptive mesh refinement (AMR) method was developed for bearing cavitation simulation. The bearing mesh can be optimized by local refinement and coarsening, allowing for a reasonable solution with special purpose. The AMR algorithm was constructed based on a quadtree data structure with a Z-order filling curve managing cells. The hybrids of interpolation schemes on hanging nodes were applied. A cell matching method was used to handle periodic boundary conditions. The difference schemes at the nonuniform mesh for the universal Reynolds equation were derived. Ausas’ cavitation algorithm was integrated into the AMR algorithm. The Richardson extrapolation method was employed as an a posteriori error estimation to guide the areas where they need to be refined. The cases of a journal bearing and a thrust bearing were studied. The results showed that the AMR method provided nearly the same accuracy results compared with the uniform mesh, while the number of mesh was reduced to 50–60% of the number of the uniform mesh. The computational efficiency was effectively improved. The AMR method is suggested to be a potential tool for bearing cavitation simulation.


Sign in / Sign up

Export Citation Format

Share Document