Combined swept region and intersection‐based single‐material remapping method

A typical arbitrary Lagrangian–Eulerian algorithm consists of a Lagrangian step, where the computational mesh moves with the fluid flow; a rezoning step, where the computational mesh is smoothed and repaired in case it gets too distorted; and a remapping step, where all fluid quantities are conservatively interpolated on this new mesh. In single‐material simulations, the remapping process can be represented in a flux form, with fluxes approximated by integrating a reconstructed function over intersections of neighboring computational cells on the original and rezoned computational mesh. This algorithm is complex and computationally demanding – Therefore, a simpler approach that utilizes regions swept by the cell edges during rezoning is often used in practice. However, it has been observed that such simplification can lead to distortion of the solution symmetry, especially when the mesh movement is not bound by such symmetry. For this reason, we propose an algorithm combining both approaches in a similar way that was proposed for multi‐material remapping (two‐step hybrid remap). Intersections and exact integration are employed only in certain parts of the computational mesh, marked by a switching function – Various different criteria are presented in this paper. The swept‐based method is used elsewhere in areas that are not marked. This way, our algorithm can retain the beneficial symmetry‐preserving capabilities of intersection‐based remapping while keeping the overall computational cost moderate.     

A swept‐intersection‐based remapping method in a ReALE framework

A complete reconnection‐based arbitrary Lagrangian–Eulerian (ReALE) strategy devoted to the computation of hydrodynamic applications for compressible fluid flows is presented here. In ReALE, we replace the rezoning phase of classical ALE method by a rezoning where we allow the connectivity between cells of the mesh to change. This leads to a polygonal mesh that recovers the Lagrangian features in order to follow more efficiently the flow. Those reconnections allow to deal with complex geometries and high vorticity problems contrary to ALE method. For optimizing the remapping phase, we have modified the idea of swept‐integration‐based. The new method is called swept‐intersection‐based remapping method. We demonstrate that our method can be applied to several numerical examples representative of hydrodynamic experiments.Copyright © 2012 John Wiley & Sons, Ltd.     

A swept intersection‐based remapping method for axisymmetric ReALE computation

We use here a reconnection ALE (ReALE) strategy to solve hydrodynamic compressible flows in cylindrical geometries. The main difference between the classical ALE and the ReALE method is the rezoning step where we allow change in the topology. This leads for ReALE to a polygonal mesh, which follows more efficiently the flow. We present here a new displacement of generators in order to keep the Lagrangian features, which are usually lost using ALE with fixed topology. The reconnection capability allows to deal with complex geometries and high‐vorticity problems contrary to ALE method. The main difficulty of ReALE is the remapping step where we have to remap physical variables on a mesh with a different topology. For this step, a new remapping method based on a swept intersection algorithm has been developed in the case of planar geometries. We present here the extension of the swept intersection‐based remapping method to cylindrical geometries. We demonstrate that our method can be applied to several numerical examples up to problem representative of hydrodynamic experiments. Copyright © 2015 John Wiley & Sons, Ltd.     

A fully discrete ALE method over untwisted time–space control volumes

In this paper, a fully discrete high‐resolution arbitrary Lagrangian–Eulerian (ALE) method is developed over untwisted time–space control volumes. In the framework of the finite volume method, 2D Euler equations are discretized over untwisted moving control volumes, and the resulting numerical flux is computed using the generalized Riemann problem solver. Then, the fluid flows between meshes at two successive time steps can be updated without a remapping process in the classic ALE method. This remapping‐free ALE method directly couples the mesh motion into a physical variable update to reflect the temporal evolution in the whole process. An untwisted moving mesh is generated in terms of the vorticity‐free part of the fluid velocity according to the Helmholtz theorem. Some typical numerical tests show the competitive performance of the current method. Copyright © 2016 John Wiley & Sons, Ltd.     

A Lagrangian Discontinuous Galerkin‐type method on unstructured meshes to solve hydrodynamics problems

This paper concerns a new Lagrangian Discontinuous Galerkin‐type method to solve 2D fluid flows on unstructured meshes. By using a basis of Bernstein polynomials of degree m in each triangle, we define a diffusion process which ensures positivity and stability of the scheme. The discontinuities of the physical variables at the interfaces between cells are solved with an acoustic Riemann solver. A remeshing/remapping process is performed with a particle method: the remapping is locally conservative and its accuracy can be adapted to the accuracy of the numerical method. Copyright © 2004 John Wiley & Sons, Ltd.     

A 3D finite element ALE method using an approximate Riemann solution

Arbitrary Lagrangian–Eulerian finite volume methods that solve a multidimensional Riemann‐like problem at the cell center in a staggered grid hydrodynamic (SGH) arrangement have been proposed. This research proposes a new 3D finite element arbitrary Lagrangian–Eulerian SGH method that incorporates a multidimensional Riemann‐like problem. Two different Riemann jump relations are investigated. A new limiting method that greatly improves the accuracy of the SGH method on isentropic flows is investigated. A remap method that improves upon a well‐known mesh relaxation and remapping technique in order to ensure total energy conservation during the remap is also presented. Numerical details and test problem results are presented. Copyright © 2016 John Wiley & Sons, Ltd.     

An improved second moment method for solution of pure advection problems

The second moment numerical method (SMM) of Egan and Mahoney [Numerical modeling of advection and diffusion of urban area source pollutant. Journal of Applied Meteorology 1972; 11 : 312–322] is adapted to solve for the pure advection transport equation in a variety of flow fields. SMM eliminates numerical diffusion by employing a procedure that takes into account the first and second moments of mass distribution in each grid element. For pure translational flow fields, the method is conservative, positive definite and shape‐preserving. In rotational and/or shear flows, the accuracy of SMM is significantly reduced. Two improvements are presented to make the SMM applicable to a wider range of flow problems. It is shown that the improved SMM (ISMM) is less diffusive and more shape‐preserving than the SMM in rotational and/or deformational flows. The ISMM can also be used to solve for a color function in compressible flow fields. The computational efficiency of this method is compared with that of other methods and, for a given accuracy, it is shown that ISMM is a cost‐effective, non‐diffusive and shape‐preserving method. Copyright © 2000 John Wiley & Sons, Ltd.     

The Parabolic Spline Method (PSM) for conservative transport problems

A new and efficient parabolic spline based remapping algorithm is developed and tested herein. To ensure mass conservation, the scheme solves an integral form of the transport equation rather than the differential form. The integrals are computed from reconstructed parabolic splines with mass conservation constraints. For higher dimensions, this remapping can be used within a standard directional splitting methodology or within the flow‐dependent cascade splitting approach. A grid and sub‐grid based monotonic filter is also incorporated into the overall scheme. A truncation error analysis of the scheme is presented and discussed in terms of results from test cases. The analysis shows that although it has a similar truncation error in the converged limit as that of the widely used Piecewise Parabolic Method (PPM) for infinitely differentiable functions, PSM is more accurate than PPM for problems with slow spectral decay. Additionally, an operation count of the scheme is given which demonstrates the computational advantage of PSM compared to PPM. © Crown copyright 2005. Reproduced with the permission of Her Majesty's Stationery Office. Published by John Wiley & Sons, Ltd.     

A moving mesh BGK scheme for multi‐material flows

In this paper, a moving mesh BGK scheme (MMBGK) for multi‐material flow computations is proposed. The basic idea of constructing the MMBGK is to couple the Lagrangian method, which tracks material interfaces and keeps the interfaces sharp, with a remapping‐free ALE‐type kinetic method within each single material region, where the kinetic method is based on the BGK (Bhatnagar–Gross–Krook) model. Within each single material region, a numerical flux formulation is developed on moving meshes from motion of microscope particles, and the mesh velocity is determined by requiring both mesh adaptation for accuracy and robustness, such that the grids are moving towards to the regions with high flow gradients in a way of diffusive mechanism (velocity) to adjust the distances between neighboring cells, thus increasing the numerical accuracy. To keep the sharpness of material interfaces, the Lagrangian velocity and flux are constructed at the interfaces only. Consequently, a BGK‐scheme‐based ALE‐type method (i.e., the MMBGK scheme) for multi‐material flows is constructed. Numerical examples in one and two dimensions are presented to illustrate the accuracy and robustness of the MMBGK scheme. Copyright © 2011 John Wiley & Sons, Ltd.     

质点积分守恒重映方法

针对大变形流体动力学数值计算中经常需要应用的网格重构与物理量重映技术,提出了一种逻辑简单的质点积分守恒重映方法。将旧网格细分为众多有体积的质点,并将旧网格的物理量分配到各个质点,新网格各守恒量的积分直接由落在新网格内的所有质点的物理量累加。建立了收敛速度极快的计算格式,采用的控制体很好地解决了速度的重映计算问题。分析了此守恒重映方法的收敛性与守恒性,研究了积分控制体对速度计算的影响。     

Development of level set method with good area preservation to predict interface in two‐phase flows

A two‐step conservative level set method is proposed in this study to simulate the gas/water two‐phase flow. For the sake of accuracy, the spatial derivative terms in the equations of motion for an incompressible fluid flow are approximated by the coupled compact scheme. For accurately predicting the modified level set function, the dispersion‐relation‐preserving advection scheme is developed to preserve the theoretical dispersion relation for the first‐order derivative terms shown in the pure advection equation cast in conservative form. For the purpose of retaining its long‐time accurate Casimir functionals and Hamiltonian in the transport equation for the level set function, the time derivative term is discretized by the sixth‐order accurate symplectic Runge–Kutta scheme. To resolve contact discontinuity oscillations near interface, nonlinear compression flux term and artificial damping term are properly added to the second‐step equation of the modified level set method. For the verification of the proposed dispersion‐relation‐preserving scheme applied in non‐staggered grids for solving the incompressible flow equations, three benchmark problems have been chosen in this study. The conservative level set method with area‐preserving property proposed for capturing the interface in incompressible fluid flows is also verified by solving the dam‐break, Rayleigh–Taylor instability, bubble rising in water, and droplet falling in water problems. Good agreements with the referenced solutions are demonstrated in all the investigated problems. Copyright © 2010 John Wiley & Sons, Ltd.     

一类格心型ALE有限体积格式方法

现在国内外流行的ALE有限体积格式基本上都基于交错网榕进行格式的离散.该类格武在进行重映时,速度、密度和能量需要分别进行重映计算,效率较低,而且由于速度在网格角点.而密度、能量在网格中心,重映时会出现动能和内能不协调现泉.本文在巳有格心型Lagrange有限体积格式研究的基础上,结合Abgrall R.等关于榕心型格式下的网格角点速度的计算方法,利用最小二乘法进行高阶插值多项式重构,构造了一类新的格心型的高精度Lagrangian有限体积格式,并结合有效的高精度ENO守恒重映方法,获得了一类格心型的高精度ALE有限体积格式.数值试验的结果说明本文的格式是有效的,高精度的,收敛的,并且避免了物理量的不协调现象.     

Numerical analysis of conservative unstructured discretisations for low Mach flows

Unstructured meshes allow easily representing complex geometries and to refine in regions of interest without adding control volumes in unnecessary regions. However, numerical schemes used on unstructured grids have to be properly defined in order to minimise numerical errors. An assessment of a low Mach algorithm for laminar and turbulent flows on unstructured meshes using collocated and staggered formulations is presented. For staggered formulations using cell‐centred velocity reconstructions, the standard first‐order method is shown to be inaccurate in low Mach flows on unstructured grids. A recently proposed least squares procedure for incompressible flows is extended to the low Mach regime and shown to significantly improve the behaviour of the algorithm. Regarding collocated discretisations, the odd–even pressure decoupling is handled through a kinetic energy conserving flux interpolation scheme. This approach is shown to efficiently handle variable‐density flows. Besides, different face interpolations schemes for unstructured meshes are analysed. A kinetic energy‐preserving scheme is applied to the momentum equations, namely, the symmetry‐preserving scheme. Furthermore, a new approach to define the far‐neighbouring nodes of the quadratic upstream interpolation for convective kinematics scheme is presented and analysed. The method is suitable for both structured and unstructured grids, either uniform or not. The proposed algorithm and the spatial schemes are assessed against a function reconstruction, a differentially heated cavity and a turbulent self‐igniting diffusion flame. It is shown that the proposed algorithm accurately represents unsteady variable‐density flows. Furthermore, the quadratic upstream interpolation for convective kinematics scheme shows close to second‐order behaviour on unstructured meshes, and the symmetry‐preserving is reliably used in all computations. Copyright © 2016 John Wiley & Sons, Ltd.     

Optimized sixth‐order monotonicity‐preserving scheme by nonlinear spectral analysis

In this paper, sixth‐order monotonicity‐preserving optimized scheme (OMP6) for the numerical solution of conservation laws is developed on the basis of the dispersion and dissipation optimization and monotonicity‐preserving technique. The nonlinear spectral analysis method is developed and is used for the purpose of minimizing the dispersion errors and controlling the dissipation errors. The new scheme (OMP6) is simple in expression and is easy for use in CFD codes. The suitability and accuracy of this new scheme have been tested through a set of one‐dimensional, two‐dimensional, and three‐dimensional tests, including the one‐dimensional Shu–Osher problem, the two‐dimensional double Mach reflection, and the Rayleigh–Taylor instability problem, and the three‐dimensional direct numerical simulation of decaying compressible isotropic turbulence. All numerical tests show that the new scheme has robust shock capturing capability and high resolution for the small‐scale waves due to fewer numerical dispersion and dissipation errors. Moreover, the new scheme has higher computational efficiency than the well‐used WENO schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

Exactly well‐balanced positivity preserving nonstaggered central scheme for open‐channel flows

In this paper, we construct and study an exactly well‐balanced positivity‐preserving nonstaggered central scheme for shallow water flows in open channels with irregular geometry and nonflat bottom topography. We introduce a novel discretization of the source term based on hydrostatic reconstruction to obtain the exactly well‐balanced property for the still water steady‐state solution even in the presence of wetting and drying transitions. The positivity‐preserving property of the cross‐sectional wet area is obtained by using a modified “draining" time‐step technique. The current scheme is also Riemann‐solver‐free. Several classical problems of open‐channel flows are used to test these properties. Numerical results confirm that the current scheme is robust, exactly well‐balanced and positivity‐preserving.     

A well‐balanced stable generalized Riemann problem scheme for shallow water equations using adaptive moving unstructured triangular meshes

We propose a well‐balanced stable generalized Riemann problem (GRP) scheme for the shallow water equations with irregular bottom topography based on moving, adaptive, unstructured, triangular meshes. In order to stabilize the computations near equilibria, we use the Rankine–Hugoniot condition to remove a singularity from the GRP solver. Moreover, we develop a remapping onto the new mesh (after grid movement) based on equilibrium variables. This, together with the already established techniques, guarantees the well‐balancing. Numerical tests show the accuracy, efficiency, and robustness of the GRP moving mesh method: lake at rest solutions are preserved even when the underlying mesh is moving (e.g., mesh points are moved to regions of steep gradients), and various comparisons with fixed coarse and fine meshes demonstrate high resolution at relatively low cost. Copyright © 2013 John Wiley & Sons, Ltd.     

Provably stable and time‐accurate extensions of Runge–Kutta schemes for CFD computations on moving grids

Extending fixed‐grid time integration schemes for unsteady CFD applications to moving grids, while formally preserving their numerical stability and time accuracy properties, is a nontrivial task. A general computational framework for constructing stability‐preserving ALE extensions of Eulerian multistep time integration schemes can be found in the literature. A complementary framework for designing accuracy‐preserving ALE extensions of such schemes is also available. However, the application of neither of these two computational frameworks to a multistage method such as a Runge–Kutta (RK) scheme is straightforward. Yet, the RK methods are an important family of explicit and implicit schemes for the approximation of solutions of ordinary differential equations in general and a popular one in CFD applications. This paper presents a methodology for filling this gap. It also applies it to the design of ALE extensions of fixed‐grid explicit and implicit second‐order time‐accurate RK (RK2) methods. To this end, it presents the discrete geometric conservation law associated with ALE RK2 schemes and a method for enforcing it. It also proves, in the context of the nonlinear scalar conservation law, that satisfying this discrete geometric conservation law is a necessary and sufficient condition for a proposed ALE extension of an RK2 scheme to preserve on moving grids the nonlinear stability properties of its fixed‐grid counterpart. All theoretical findings reported in this paper are illustrated with the ALE solution of inviscid and viscous unsteady, nonlinear flow problems associated with vibrations of the AGARD Wing 445.6. Copyright © 2011 John Wiley & Sons, Ltd.     

On unconditionally positive implicit time integration for the DG scheme applied to shallow water flows

We present a new unconditionally positivity‐preserving (PP) implicit time integration method for the DG scheme applied to shallow water flows. This novel time discretization enhances the currently used PP DG schemes, because in the majority of previous work, explicit time stepping is implemented to deal with wetting and drying. However, for explicit time integration, linear stability requires very small time steps. Especially for locally refined grids, the stiff system resulting from space discretization makes implicit or partially implicit time stepping absolutely necessary. As implicit schemes require a lot of computational time solving large systems of nonlinear equations, a much larger time step is necessary to beat explicit time stepping in terms of CPU time. Unfortunately, the current PP implicit schemes are subject to time step restrictions due to a so‐called strong stability preserving constraint. In this work, we hence give a novel approach to positivity preservation including its theoretical background. The new technique is based on the so‐called Patankar trick and guarantees non‐negativity of the water height for any time step size while still preserving conservativity. In the DG context, we prove consistency of the discretization as well as a truncation error of the third order away from the wet–dry transition. Because of the proposed modification, the implicit scheme can take full advantage of larger time steps and is able to beat explicit time stepping in terms of CPU time. The performance and accuracy of this new method are studied for several classical test cases. Copyright © 2014 John Wiley & Sons, Ltd.     

Parallel solution of three‐dimensional Marangoni flow in liquid bridges

This paper describes the implementation and performances of a parallel solver for the direct numerical simulation of the three‐dimensional and time‐dependent Navier–Stokes equations on distributed‐memory, massively parallel computers. The feasibility of this approach to study Marangoni flow instability in half zone liquid bridges is examined. The results indicate that the incompressible, non‐linear Navier–Stokes problem, governing the Marangoni flows behavior, can effectively be parallelized on a distributed memory parallel machine by remapping the distributed data structure. The numerical code is based on a three‐dimensional Simplified Marker and Cell (SMAC) primitive variable method applied to a staggered finite difference grid. Using this method, the problem is split into two problems, one parabolic and the other elliptic A parallel algorithm, explicit in time, is utilized to solve the parabolic equations. A parallel multisplitting kernel is introduced for the solution of the pseudo pressure elliptic equation, representing the most time‐consuming part of the algorithm. A grid‐partition strategy is used in the parallel implementations of both the parabolic equations and the multisplitting elliptic kernel. A Message Passing Interface (MPI) is coded for the boundary conditions; this protocol is portable to different systems supporting this interface for interprocessor communications. Numerical experiments illustrate good numerical properties and parallel efficiency. In particular, good scalability on a large number of processors can be achieved as long as the granularity of the parallel application is not too small. However, increasing the number of processors, the Speed‐Up is ever smaller than the ideal linear Speed‐Up. The communication timings indicate that complex practical calculations, such as the solutions of the Navier–Stokes equations for the numerical simulation of the instability of Marangoni flows, can be expected to run on a massively parallel machine with good efficiency. Copyright © 1999 John Wiley & Sons, Ltd.     

A mass conservative well‐balanced reconstruction at wet/dry interfaces for the Godunov‐type shallow water model

This paper presents a novel mass conservative, positivity preserving wetting and drying treatment for Godunov‐type shallow water models with second‐order bed elevation discretization. The novel method allows to compute water depths equal to machine accuracy without any restrictions on the time step or any threshold that defines whether the finite volume cell is considered to be wet or dry. The resulting scheme is second‐order accurate in space and keeps the C‐property condition at fully flooded area and also at the wet/dry interface. For the time integration, a second‐order accurate Runge–Kutta method is used. The method is tested in two well‐known computational benchmarks for which an analytical solution can be derived, a C‐property benchmark and in an additional example where the experimental results are reproduced. Overall, the presented scheme shows very good agreement with the reference solutions. The method can also be used in the discontinuous Galerkin method. Copyright © 2016 John Wiley & Sons, Ltd.