Abstract

This work aims at improving the 2-D incompressible SPH model (ISPH) by adapting it to the unified semi-analytical wall boundary conditions proposed by Ferrand et al. [10]. The ISPH algorithm considered is as proposed by Lind et al. [25], based on the projection method with a divergence-free velocity field and using a stabilising procedure based on particle shifting. However, we consider an extension of this model to Reynolds-Averaged Navier–Stokes equations based on the k–ϵ turbulent closure model, as done in [10]. The discrete SPH operators are modified by the new description of the wall boundary conditions. In particular, a boundary term appears in the Laplacian operator, which makes it possible to accurately impose a von Neumann pressure wall boundary condition that corresponds to impermeability. The shifting and free-surface detection algorithms have also been adapted to the new boundary conditions. Moreover, a new way to compute the wall renormalisation factor in the frame of the unified semi-analytical boundary conditions is proposed in order to decrease the computational time. We present several verifications to the present approach, including a lid-driven cavity, a water column collapsing on a wedge and a periodic schematic fish-pass. Our results are compared to Finite Volumes methods, using Volume of Fluids in the case of free-surface flows. We briefly investigate the convergence of the method and prove its ability to model complex free-surface and turbulent flows. The results are generally improved when compared to a weakly compressible SPH model with the same boundary conditions, especially in terms of pressure prediction.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.