scholarly journals Solution Verification Studies of a Pressure-Based Compressible Flow Solver

Author(s):  
J. Muralha ◽  
C. Silva ◽  
L. Eça ◽  
C. Klaij
2021 ◽  
Vol 81 ◽  
pp. 351-372
Author(s):  
Zhen-Guo Yan ◽  
Yu Pan ◽  
Giacomo Castiglioni ◽  
Koen Hillewaert ◽  
Joaquim Peiró ◽  
...  

Author(s):  
João Muralha ◽  
Luís Eça ◽  
Christiaan M. Klaij

Abstract Although most flows in maritime applications can be modeled as incompressible, for certain phenomena like sloshing, slamming, and cavitation, this approximation falls short. For these events, it is necessary to consider compressibility effects. This paper presents the first step toward a solver for multiphase compressible flows: a single-phase compressible flow solver for perfect gases. The main purpose of this work is code verification of the solver using the method of manufactured solutions. For the sake of completeness, the governing equations are described in detail including the changes to the SIMPLE algorithm used in the incompressible flow solver to ensure mass conservation and pressure–velocity–density coupling. A manufactured solution for laminar subsonic flow was therefore designed. With properly defined boundary conditions, the observed order of grid convergence matches the formal order, so it can be concluded that the flow solver is free of coding mistakes, to the extent tested by the method of manufactured solutions. The performance of the pressure-based SIMPLE solver is quantified by reporting iteration counts for all grids. Furthermore, the use of pressure–weighted interpolation (PWI), also known as Rhie–Chow interpolation, to avoid spurious pressure oscillations in incompressible flow, though not strictly necessary for compressible flow, does show some benefits in the low Mach number range.


Author(s):  
Z. Jibben ◽  
J. Velechovsky ◽  
T. Masser ◽  
M. Francois

We present a method to simulate surface tension between immiscible materials within an inviscid compressible flow solver. The material interface is represented using the volume of fluid technique with piecewise-linear interface reconstruction. We employ the continuum surface force model for surface tension, implemented in the context of the MUSCL-Hancock finite volume method for the Euler equations on an adaptively refined Eulerian mesh. We show results for droplet verification test cases.


Author(s):  
Jan Hückelheim ◽  
Paul Hovland ◽  
Michelle Mills Strout ◽  
Jens-Dominik Müller

Reverse-mode algorithmic differentiation (AD) is an established method for obtaining adjoint derivatives of computer simulation applications. In computational fluid dynamics (CFD), adjoint derivatives of a cost function output such as drag or lift with respect to design parameters such as surface coordinates or geometry control points are a key ingredient for shape optimization, uncertainty quantification and flow control. The computational cost of CFD applications and their derivatives makes it essential to use high-performance computing hardware efficiently, including multi- and many-core architectures. Nevertheless, OpenMP is not supported in most AD tools, and previously shown methods achieve poor scalability of the derivative code. We present the AD of an OpenMP-parallelized finite volume compressible flow solver for unstructured meshes. Our approach enables us to reuse the parallelization of the original code in the computation of adjoint derivatives. The method works by identifying code segments that can be differentiated in reverse-mode without changing their memory access pattern. The OpenMP parallelization is integrated into the derivative code during the build process in a way that is robust to modifications of the original code and independent of the OpenMP support of the differentiation tool. We show the scalability of our adjoint CFD solver on test cases ranging from thousands to millions of finite volume mesh cells on CPUs with up to 16 threads as well as on an Intel XeonPhi card with 236 threads. We demonstrate that our approach is more practical to implement for production-sized CFD codes and produces more efficient adjoint derivative code than previously shown AD methods.


Sign in / Sign up

Export Citation Format

Share Document