A kernel-based discretisation method for first order partial differential equations

From MaRDI portal
Publication:4637577

DOI10.1090/MCOM/3265zbMATH Open1394.65087arXiv1601.06142OpenAlexW2596129588MaRDI QIDQ4637577FDOQ4637577


Authors: Tobias Ramming, Holger Wendland Edit this on Wikidata


Publication date: 24 April 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: We derive a new discretisation method for first order PDEs of arbitrary spatial dimension, which is based upon a meshfree spatial approximation. This spatial approximation is similar to the SPH (smoothed particle hydrodynamics) technique and is a typical kernel-based method. It differs, however, significantly from the SPH method since it employs an Eulerian and not a Lagrangian approach. We prove stability and convergence for the resulting semi-discrete scheme under certain smoothness assumptions on the defining function of the PDE. The approximation order depends on the underlying kernel and the smoothness of the solution. Hence, we also review an easy way of constructing smooth kernels yielding arbitrary convergence orders. Finally, we give a numerical example by testing our method in the case of a one-dimensional Burgers equation.


Full work available at URL: https://arxiv.org/abs/1601.06142




Recommendations




Cites Work


Cited In (7)





This page was built for publication: A kernel-based discretisation method for first order partial differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637577)