scholarly journals Topology-Aware Performance Optimization and Modeling of Adaptive Mesh Refinement Codes for Exascale

Author(s):  
Cy P Chan ◽  
John D Bachan ◽  
Joseph P Kenny ◽  
Jeremiah J Wilke ◽  
Vincent E Beckner ◽  
...  
2021 ◽  
pp. 1-32
Author(s):  
Pinaki Pal ◽  
Gaurav Kumar ◽  
Scott Drennan ◽  
Brent Rankin ◽  
Sibendu Som

Abstract In the present work, a novel computational fluid dynamics (CFD) methodology was developed to simulate full-scale non-premixed RDEs. A unique feature of the modeling approach was incorporation of adaptive mesh refinement (AMR) to achieve good trade-off between model accuracy and computational expense. Unsteady Reynolds-Averaged Navier-Stokes (RANS) simulations were performed for an Air Force Research Laboratory (AFRL) non-premixed RDE configuration with hydrogen as fuel and air as the oxidizer. The finite-rate chemistry model along with a 10-species detailed kinetic mechanism were employed to describe the H2-Air combustion chemistry. Three distinct operating conditions were simulated, corresponding to the same global equivalence ratio of unity but different fuel/air mass flow rates. For all conditions, the capability of the model to capture essential detonation wave dynamics was assessed. An exhaustive verification and validation study was performed against experimental data in terms of number of waves, wave frequency, wave height, reactant fill height, oblique shock angle, axial pressure distribution in the channel, and fuel/air plenum pressure. The CFD model was demonstrated to accurately predict the sensitivity of these wave characteristics to the operating conditions, both qualitatively and quantitatively. A comprehensive heat release analysis was conducted to quantify detonative versus deflagrative burning for the three simulated cases. The present CFD model offers a potential capability to perform rapid design space exploration and/or performance optimization studies for realistic full-scale RDE configurations.


2018 ◽  
Vol 50 (04) ◽  
pp. 561-570
Author(s):  
I. A. QAZI ◽  
A. F. ABBASI ◽  
M. S. JAMALI ◽  
INTIZAR INTIZAR ◽  
A. TUNIO ◽  
...  

Author(s):  
Alexander Haberl ◽  
Dirk Praetorius ◽  
Stefan Schimanko ◽  
Martin Vohralík

AbstractWe consider a second-order elliptic boundary value problem with strongly monotone and Lipschitz-continuous nonlinearity. We design and study its adaptive numerical approximation interconnecting a finite element discretization, the Banach–Picard linearization, and a contractive linear algebraic solver. In particular, we identify stopping criteria for the algebraic solver that on the one hand do not request an overly tight tolerance but on the other hand are sufficient for the inexact (perturbed) Banach–Picard linearization to remain contractive. Similarly, we identify suitable stopping criteria for the Banach–Picard iteration that leave an amount of linearization error that is not harmful for the residual a posteriori error estimate to steer reliably the adaptive mesh-refinement. For the resulting algorithm, we prove a contraction of the (doubly) inexact iterates after some amount of steps of mesh-refinement/linearization/algebraic solver, leading to its linear convergence. Moreover, for usual mesh-refinement rules, we also prove that the overall error decays at the optimal rate with respect to the number of elements (degrees of freedom) added with respect to the initial mesh. Finally, we prove that our fully adaptive algorithm drives the overall error down with the same optimal rate also with respect to the overall algorithmic cost expressed as the cumulated sum of the number of mesh elements over all mesh-refinement, linearization, and algebraic solver steps. Numerical experiments support these theoretical findings and illustrate the optimal overall algorithmic cost of the fully adaptive algorithm on several test cases.


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.


Sign in / Sign up

Export Citation Format

Share Document