An alternative SPH formulation: ADER-WENO-SPH

We present a new class of fully-discrete one-step SPH schemes based on a mesh-free ADER (Arbitrary DERivatives in space and time) reconstruction on moving particles in multiple space dimensions. In particular, the new SPH scheme computes mesh-free and local high order accurate polynomials in space a...

Full description

Saved in:
Bibliographic Details
Published in:Computer methods in applied mechanics and engineering 2021-08, Vol.382, p.113871, Article 113871
Main Authors: Avesani, Diego, Dumbser, Michael, Vacondio, Renato, Righetti, Maurizio
Format: Article
Language:English
Subjects:
Compressibility
Compressible Euler equations of gas dynamics
Computational fluid dynamics
Conservation laws
Fluid flow
Fluxes
Fully-discrete one-step ADER schemes
Integrators
Magnetohydrodynamics
Meshfree Lagrangian particle method
Meshless methods
Nonlinear systems
Polynomials
Rarefaction
Riemann solver
Runge-Kutta method
Smooth particle hydrodynamics (SPH)
WENO reconstruction
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a new class of fully-discrete one-step SPH schemes based on a mesh-free ADER (Arbitrary DERivatives in space and time) reconstruction on moving particles in multiple space dimensions. In particular, the new SPH scheme computes mesh-free and local high order accurate polynomials in space and time to evaluate numerical fluxes at the midpoint between two interaction particles with a proper Riemann solver within the general SPH framework of Vila (1999) for nonlinear systems of hyperbolic conservation laws. The new scheme has been carefully tested against reference solutions for both the compressible Euler and the magneto-hydrodynamics (MHD) equations. The capability of the proposed scheme to accurately capture shocks and rarefaction waves for 1D and 2D problems with minimal amount of diffusion has been demonstrated. Via numerical evidence it has been shown that the new fully-discrete one-step ADER-WENO-SPH method is computationally more efficient than WENO-SPH schemes based on classical Runge–Kutta time-stepping. This is mainly due to the fact that with ADER timestepping the expensive stencil and neighbor search needs to be done only once per time step, while with Runge–Kutta time integrators the neighbor and stencil search is needed in each Runge–Kutta stage again.
ISSN:0045-7825
1879-2138
DOI:10.1016/j.cma.2021.113871