vix.ing · top · new · best · stats · spec

Analysis of the incompressibility constraint in the smoothed particle hydrodynamics method

2011/10/26 by Kamil Szewc, Jacek Pozorski, Jean-Pierre Minier
Engineering · Mathematics · Physics and Astronomy · #Algorithm #Applied mathematics #Boundary (topology) #Boundary value problem #Classical mechanics #Compressibility #Compressible flow #Computer science #Constraint (computer-aided design) #Divergence (linguistics) #Dykstra's projection algorithm #Equation of state #Field (mathematics) #Flow (mathematics) #Fluid Dynamics Simulations and Interactions #Fluid Dynamics and Heat Transfer #Geometry #Lattice Boltzmann Simulation Studies #Mathematical analysis #Mathematical optimization #Mathematics #Mechanics #Particle (ecology) #Physics #Projection (relational algebra) #Projection method #Smoothed-particle hydrodynamics #Space (punctuation) #Vector field #physics.comp-ph #physics.flu-dyn

paper · pdf · doi:10.1002/nme.4339

published as International Journal for Numerical Methods in Engineering 2012

arxiv created 2011/10/26 · openalex publication_date 2012/06/01 · arxiv updated 2012/08/22 · openalex created_date 2019/06/27 · openalex updated_date 2026/08/05

Abstract

SUMMARY Smoothed Particle Hydrodynamics (SPH) is a particle‐based, fully Lagrangian method for fluid‐flow simulations. In this work, fundamental concepts of the method are first briefly recalled. Then, we present a thorough comparison of two different incompressibility treatments in SPH: the weakly compressible approach, where a suitably chosen equation of state is used, and the truly incompressible method (in two basic variants), where the velocity field projection onto a divergence‐free space is performed. A noteworthy aspect of the study is that in each incompressibility treatment, the same boundary conditions are used (and further developed) that allows a direct comparison to be made. Two‐dimensional and three‐dimensional validation cases are studied. Problems associated with the numerical setup are discussed, and an optimal choice of the computational parameters is proposed and verified. The efficiency issues of the incompressibility treatments are considered, and the speed‐up features are highlighted. The results show that the present state‐of‐the‐art truly incompressible methods (based on a velocity correction) suffer from density accumulation errors. To address this issue, an algorithm, based on a correction for both particle velocities and positions, is presented. The usefulness of this density correction is examined and demonstrated. Copyright © 2012 John Wiley & Sons, Ltd.

Citations