Towards a High Order Convergent ALE-SPH Scheme with Efficient WENO Spatial Reconstruction
Open Access
Abstract
This paper studies the convergence properties of an arbitrary Lagrangian–Eulerian (ALE) Riemann-based SPH algorithm in conjunction with a Weighted Essentially Non-Oscillatory (WENO) high-order spatial reconstruction, in the framework of the DualSPHysics open-source code. A convergence analysis is carried out for Lagrangian and Eulerian simulations and the numerical results demonstrate that, in absence of particle disorder, the overall convergence of the scheme is close to the one guaranteed by the WENO spatial reconstruction. Moreover, an alternative method for the WENO spatial reconstruction is introduced which guarantees a speed-up of 3.5, in comparison with the classical Moving Least-Squares (MLS) approach.Keywords
This publication has 42 references indexed in Scilit:
- Incompressible smoothed particle hydrodynamics for free-surface flows: A generalised diffusion-based algorithm for stability and validations for impulsive flows and propagating wavesJournal of Computational Physics, 2012
- Truncation error in mesh‐free particle methodsInternational Journal for Numerical Methods in Engineering, 2006
- Restoring particle consistency in smoothed particle hydrodynamicsApplied Numerical Mathematics, 2006
- Remeshed Smoothed Particle Hydrodynamics for the Simulation of Viscous and Heat Conducting FlowsJournal of Computational Physics, 2002
- Moving-least-squares-particle hydrodynamics?I. Consistency and stabilityInternational Journal for Numerical Methods in Engineering, 1999
- Smoothed Particle Hydrodynamics: Some recent improvements and applicationsComputer Methods in Applied Mechanics and Engineering, 1996
- Simulating Free Surface Flows with SPHJournal of Computational Physics, 1994
- On the problem of penetration in particle methodsJournal of Computational Physics, 1989
- A numerical approach to the testing of the fission hypothesisThe Astronomical Journal, 1977
- Triangular factorization and inversion by fast matrix multiplicationMathematics of Computation, 1974