Gerris: a tree-based adaptive solver for the incompressible Euler equations in complex geometries

An adaptive mesh projection method for the time-dependent incompressible Euler equations is presented. The domain is spatially discretised using quad/octrees and a multilevel Poisson solver is used to obtain the pressure. Complex solid boundaries are represented using a volume-of-fluid approach. Second-order convergence in space and time is demonstrated on regular, statically and dynamically refined grids. The quad/octree discretisation proves to be very flexible and allows accurate and efficient tracking of flow features. The source code of the method implementation is freely available.     

Numerical simulations of two-dimensional foam by the immersed boundary method

In this paper, we present an immersed boundary (IB) method to simulate a dry foam, i.e., a foam in which most of the volume is attributed to its gas phase. Dry foam dynamics involves the interaction between a gas and a collection of thin liquid-film internal boundaries that partition the gas into discrete cells or bubbles. The liquid-film boundaries are flexible, contract under the influence of surface tension, and are permeable to the gas, which moves across them by diffusion at a rate proportional to the local pressure difference across the boundary. Such problems are conventionally studied by assuming that the pressure is uniform within each bubble. Here, we introduce instead an IB method that takes into account the non-equilibrium fluid mechanics of the gas. To model gas diffusion across the internal liquid-film boundaries, we allow normal slip between the boundary and the gas at a velocity proportional to the (normal) force generated by the boundary surface tension. We implement this method in the two-dimensional case, and test it by verifying the von Neumann relation, which governs the coarsening of a two-dimensional dry foam. The method is further validated by a convergence study, which confirms its first-order accuracy.     

An interface treating technique for compressible multi-medium flow with Runge–Kutta discontinuous Galerkin method

The high-order accurate Runge–Kutta discontinuous Galerkin (RKDG) method is applied to the simulation of compressible multi-medium flow, generalizing the interface treating method given in Chertock et al. (2008) [9]. In mixed cells, where the interface is located, Riemann problems are solved to define the states on both sides of the interface. The input states to the Riemann problem are obtained by extrapolation to the cell boundary from solution polynomials in the neighbors of the mixed cell. The level set equation is solved by using a high-order accurate RKDG method for Hamilton–Jacobi equations, resulting in a unified DG solver for the coupled problem. The method is conservative if we include the states in the mixed cells, which are however not used in the updating of the numerical solution in other cells. The states in the mixed cells are plotted to better evaluate the conservation errors, manifested by overshoots/undershoots when compared with states in neighboring cells. These overshoots/undershoots in mixed cells are problem dependent and change with time. Numerical examples show that the results of our scheme compare well with other methods for one and two-dimensional problems. In particular, the algorithm can capture well complex flow features of the one-dimensional shock entropy wave interaction problem and two-dimensional shock–bubble interaction problem.     

A grid based particle method for evolution of open curves and surfaces

We propose a new numerical method for modeling motion of open curves in two dimensions and open surfaces in three dimensions. Following the grid based particle method we proposed in [S. Leung, H.K. Zhao, A grid based particle method for moving interface problems. J. Comput. Phys. 228 (2009) 2993–3024], we represent the open curve or the open surface by meshless Lagrangian particles sampled according to an underlying fixed Eulerian mesh. The underlying grid is used to provide a quasi-uniform sampling and neighboring information for meshless particles. The key idea in the current paper is to represent and to track end-points of the open curve and boundary-points of the open surface explicitly and consistently with interior particles. We apply our algorithms to several applications including spiral crystal growth modeling and image segmentation using active contours.     

An accurate and efficient method for the incompressible Navier–Stokes equations using the projection method as a preconditioner

The projection method is a widely used fractional-step algorithm for solving the incompressible Navier–Stokes equations. Despite numerous improvements to the methodology, however, imposing physical boundary conditions with projection-based fluid solvers remains difficult, and obtaining high-order accuracy may not be possible for some choices of boundary conditions. In this work, we present an unsplit, linearly-implicit discretization of the incompressible Navier–Stokes equations on a staggered grid along with an efficient solution method for the resulting system of linear equations. Since our scheme is not a fractional-step algorithm, it is straightforward to specify general physical boundary conditions accurately; however, this capability comes at the price of having to solve the time-dependent incompressible Stokes equations at each timestep. To solve this linear system efficiently, we employ a Krylov subspace method preconditioned by the projection method. In our implementation, the subdomain solvers required by the projection preconditioner employ the conjugate gradient method with geometric multigrid preconditioning. The accuracy of the scheme is demonstrated for several problems, including forced and unforced analytic test cases and lid-driven cavity flows. These tests consider a variety of physical boundary conditions with Reynolds numbers ranging from 1 to 30000. The effectiveness of the projection preconditioner is compared to an alternative preconditioning strategy based on an approximation to the Schur complement for the time-dependent incompressible Stokes operator. The projection method is found to be a more efficient preconditioner in most cases considered in the present work.     

A conservative SPH method for surfactant dynamics

In this paper, a Lagrangian particle method is proposed for the simulation of multiphase flows with surfactant. The model is based on the multiphase smoothed particle hydrodynamics (SPH) framework of Hu and Adams (2006) [1]. Surface-active agents (surfactants) are incorporated into our method by a scalar quantity describing the local concentration of molecules in the bulk phase and on the interface. The surfactant dynamics are written in conservative form, thus global mass of surfactant is conserved exactly. The transport model of the surfactant accounts for advection and diffusion. Within our method, we can simulate insoluble surfactant on an arbitrary interface geometry as well as interfacial transport such as adsorption or desorption. The flow-field dynamics and the surfactant dynamics are coupled through a constitutive equation, which relates the local surfactant concentration to the local surface-tension coefficient. Hence, the surface-tension model includes capillary and Marangoni-forces. The present numerical method is validated by comparison with analytic solutions for diffusion and for surfactant dynamics. More complex simulations of an oscillating bubble, the bubble deformation in a shear flow, and of a Marangoni-force driven bubble show the capabilities of our method to simulate interfacial flows with surfactants.     

Adaptive meshless centres and RBF stencils for Poisson equation

We consider adaptive meshless discretisation of the Dirichlet problem for Poisson equation based on numerical differentiation stencils obtained with the help of radial basis functions. New meshless stencil selection and adaptive refinement algorithms are proposed in 2D. Numerical experiments show that the accuracy of the solution is comparable with, and often better than that achieved by the mesh-based adaptive finite element method.     

界面捕捉Level Set方法的(AMR)数值模拟

在流体力学方程的计算中采用高精度WENO格式,用AMR(adaptive mesh refinement)方法提高流场局部分辨率,在采用Level Set函数标定物质界面的计算中用GFM(ghost fluid method)方法进行界面处理,尝试将AMR技术与界面追踪技术相互融合并应用于数值模拟,对不同的模拟结果进行了比较.     

Weak solutions for partial differential equations with source terms: Application to the shallow water equations

Weak solutions of problems with m equations with source terms are proposed using an augmented Riemann solver defined by m + 1 states instead of increasing the number of involved equations. These weak solutions use propagating jump discontinuities connecting the m + 1 states to approximate the Riemann solution. The average of the propagated waves in the computational cell leads to a reinterpretation of the Roe’s approach and in the upwind treatment of the source term of Vázquez-Cendón. It is derived that the numerical scheme can not be formulated evaluating the physical flux function at the position of the initial discontinuities, as usually done in the homogeneous case. Positivity requirements over the values of the intermediate states are the only way to control the global stability of the method. Also it is shown that the definition of well-balanced equilibrium in trivial cases is not sufficient to provide correct results: it is necessary to provide discrete evaluations of the source term that ensure energy dissipating solutions when demanded. The one and two dimensional shallow water equations with source terms due to the bottom topography and friction are presented as case study. The stability region is shown to differ from the one defined for the case without source terms, and it can be derived that the appearance of negative values of the thickness of the water layer in the proximity of the wet/dry front is a particular case, of the wet/wet fronts. The consequence is a severe reduction in the magnitude of the allowable time step size if compared with the one obtained for the homogeneous case. Starting from this result, 1D and 2D numerical schemes are developed for both quadrilateral and triangular grids, enforcing conservation and positivity over the solution, allowing computationally efficient simulations by means of a reconstruction technique for the inner states of the weak solution that allows a recovery of the time step size.     

基于自适应非结构化网格的VOF方法

本文提出了一种基于自适应非结构化网格的VOF算法,根据相界面网格的相函数值对相界面网格进行自适应细化与合并,通过基于非结构化网格的界面构造方法构造相界面,在适量增加网格单元数量的情况下提高了计算的精度。该方法随着时间及相界面的变化无需重新整体生成网格,算法效率较高。经典算例的验证结果表明,本文自适应网格方法计算得到的结...     

Mesh refinement algorithms in an unstructured solver for multiphase flow simulation using discrete particles

This study developed spray-adaptive mesh refinement algorithms with directional sensitivity in an unstructured solver to improve spray simulation for internal combustion engine application. Inadequate spatial resolution is often found to cause inaccuracies in spray simulation using the Lagrangian–Eulerian approach due to the over-estimated diffusion and inappropriate liquid–gas phase coupling. Dynamic mesh refinement algorithms adaptive to fuel sprays and vapor gradients were developed in order to increase the grid resolution in the spray region to improve simulation accuracy. The local refinement introduced the coarse-fine face interface that requires advanced numerical schemes for flux calculation and grid rezoning with moving boundaries. To resolve the issue in flux calculation, this work implemented the refinement/coarsening algorithms into a collocated solver to avoid tedious interpolations in solving the momentum equations. A pressure correction method was applied to address unphysical pressure oscillations due to the collocation of pressure and velocity. An edge-based algorithm was used to evaluate the edge-centered quantities in order to account for the contributions from all the cells around an edge at the coarse-fine interface. A quasi-second-order upwind scheme with strong monotonicity was also modified to accommodate the coarse-fine interface for convective fluxes. To resolve the issue related to grid rezoning, rezoning was applied to the initial baseline mesh only and the new locations of the refined grids were obtained by interpolating the updated baseline mesh. The time step constraints were also re-evaluated to account for the change resulting from mesh refinement. The present refinement algorithm was used in simulating fuel sprays in an engine combustion chamber. It was found that the present approach could produce the same level of results as those using the uniformly fine mesh with substantially reduced computer time. Results also showed that this approach could alleviate the artifacts related to the Lagrangian discrete modeling of spray drops due to insufficient spatial resolution.     

A grid based particle method for moving interface problems

We propose a novel algorithm for modeling interface motions. The interface is represented and is tracked using quasi-uniform meshless particles. These particles are sampled according to an underlying grid such that each particle is associated to a grid point which is in the neighborhood of the interface. The underlying grid provides an Eulerian reference and local sampling rate for particles on the interface. It also renders neighborhood information among the meshless particles for local reconstruction of the interface. The resulting algorithm, which is based on Lagrangian tracking using meshless particles with Eulerian reference grid, can naturally handle/control topological changes. Moreover, adaptive sampling of the interface can be achieved easily through local grid refinement with simple quad/oct-tree data structure. Extensive numerical examples are presented to demonstrate the capability of our new algorithm.     

一种新型的液闪阵列成像屏空间分辨特性

针对低强度射线成像,自主研制了一种像元为0.1 mm高探测效率的液闪阵列屏.为此,基于倾斜刀口边缘响应的测量原理,建立了理论模拟方法和实验研究方法,对该液闪阵列屏开展了空间分辨性能研究.通过理论模拟,给出了液闪阵列屏在14 MeV中子和1.25 MeV伽马射线激发下的调制传递函数,并与像元为0.1,0.3和0.5 mm的闪烁纤维阵列屏进行了理论对比.在60Co伽马射线源上,对液闪阵列屏和像元为0.3和0.5 mm的两种国产闪烁纤维阵列屏进行了调制传递函数实测研究.理论模拟和实验结果一致,均表明液闪阵列的空间特性优于闪烁纤维阵列屏,而且具有更好的均匀性,对1.25 MeV伽马,空间分辨接近0.9 lp/mm,而其他两种纤维阵列屏仅达到0.5 lp/mm,对于14 MeV中子,液闪阵列屏的空间分辨可达到1.8 lp/mm.     

Numerical approximation of the Vlasov–Poisson–Fokker–Planck system in two dimensions

A numerical method is developed for approximating the solution to the Vlasov–Poisson–Fokker–Planck system in two spatial dimensions. The method generalizes the approximation for the system in one dimension given in [S. Wollman, E. Ozizmir, Numerical approximation of the Vlasov–Poisson–Fokker–Planck system in one dimension, J. Comput. Phys. 202 (2005) 602–644]. The numerical procedure is based on a change of variables that puts the convection–diffusion equation into a form so that finite difference methods for parabolic type partial differential equations can be applied. The computational cycle combines a type of deterministic particle method with a periodic interpolation of the solution along particle trajectories onto a fixed grid. computational work is done to demonstrate the accuracy and effectiveness of the approximation method. Parts of the numerical procedure are adapted to run on a parallel computer.     

Adaptive Runge–Kutta discontinuous Galerkin methods using different indicators: One-dimensional case

In this paper, we systematically investigate adaptive Runge–Kutta discontinuous Galerkin (RKDG) methods for hyperbolic conservation laws with different indicators which were based on the troubled cell indicators studied by Qiu and Shu [J. Qiu, C.-W. Shu, A comparison of troubled-cell indicators for Runge–Kutta discontinuous Galerkin mehtods using weighted essentially non-osillatory limiters, SIAM J. Sci. Comput. 27 (2005) 995–1013]. The emphasis is on comparison of the performance of adaptive RKDG method using different indicators, with an objective of obtaining efficient and reliable indicators to obtain better performance for adaptive computation to save computational cost. Both h-version and r-version adaptive methods are considered in the paper. The idea is to first identify “troubled cells” by different troubled-cell indicators, namely those cells where limiting might be needed and discontinuities might appear, then adopt an adaptive approach in these cells. A detailed numerical study in one-dimensional case is performed, addressing the issues of efficiency (less CPU cost and more accurate), non-oscillatory property, and resolution of discontinuities.     

An edge-based unstructured mesh discretisation in geospherical framework

An arbitrary finite-volume approach is developed for discretising partial differential equations governing fluid flows on the sphere. Unconventionally for unstructured-mesh global models, the governing equations are cast in the anholonomic geospherical framework established in computational meteorology. The resulting discretisation retains proven properties of the geospherical formulation, while it offers the flexibility of unstructured meshes in enabling irregular spatial resolution. The latter allows for a global enhancement of the spatial resolution away from the polar regions as well as for a local mesh refinement. A class of non-oscillatory forward-in-time edge-based solvers is developed and applied to numerical examples of three-dimensional hydrostatic flows, including shallow-water benchmarks, on a rotating sphere.     

A new surface-tension formulation for multi-phase SPH using a reproducing divergence approximation

In this paper, we propose a new surface-tension formulation for multi-phase smoothed particle hydrodynamics (SPH). To obtain a stable and accurate scheme for surface curvature, a new reproducing divergence approximation without the need for a matrix inversion is derived. Furthermore, we introduce a density-weighted color-gradient formulation to reflect the reality of an asymmetrically distributed surface-tension force. We validate our method with analytic solutions and demonstrate convergence for different cases. Furthermore, we show that our formulation can handle phase interfaces with density and viscosity ratios of up to 1000 and 100, respectively. Finally, complex three-dimensional simulations including breakup of an interface demonstrate the capabilities of our method.     

The finite volume local evolution Galerkin method for solving the hyperbolic conservation laws

This paper presents a finite volume local evolution Galerkin (FVLEG) scheme for solving the hyperbolic conservation laws. The FVLEG scheme is the simplification of the finite volume evolution Galerkin method (FVEG). In FVEG, a necessary step is to compute the dependent variables at cell interfaces at t_n + τ (0 < τ ? Δt). The FVLEG scheme is constructed by taking τ → 0 in the evolution operators of FVEG. The FVLEG scheme greatly simplifies the evaluation of the numerical fluxes. It is also well suited with the semi-discrete finite volume method, making the flux evaluation being decoupled with the reconstruction procedure while maintaining the genuine multi-dimensional nature of the FVEG methods. The derivation of the FVLEG scheme is presented in detail. The performance of the proposed scheme is studied by solving several test cases. It is shown that FVLEG scheme can obtain very satisfactory numerical results in terms of accuracy and resolution.     

一种深度学习的立体阵波达方向估计方法

针对常规波束形成主瓣宽且目标分辨能力低的问题,提出一种基于深度卷积神经网络的波达方向估计方法。算法使用常规波束形成计算二维空间功率谱,将预处理后的空间功率谱图输入深度卷积神经网络。该文利用神经网络学习解卷积映射关系,输出主瓣宽度更窄的空间功率谱图,从而实现高分辨率二维波达方向估计。该算法对阵列结构没有限制,适用于立体阵。仿真结果表明该文方法在不同目标个数、快拍数及信噪比参数下均能准确估计目标方向。该文方法目标分辨能力优于常规波束形成方法。在低快拍情况下,目标方向估计误差低于自适应波束形成方法。