High order Semi-Lagrangian particle methods for transport equations: numerical analysis and implementation issues

Moreover, in the spirit of the EMSM, the CSVM is adapted to a discretization in size phase space into size intervals called sections (such as in the Multifluid point of view),

Our goal is to provide with a thorough treatment of nonzero incoming boundary data and to design numerical boundary conditions that recover the optimal rate of convergence in

Classical approaches for getting high weak order numerical schemes for stochastic differential equations are based on weak Taylor ap- proximation or Runge-Kutta type methods [8,

Considering (4.2) as initial data, Table 4.2 shows the failure in the spatial error by solving the original equation (1.1) in the highly oscillatory regime, where we use the

On the high-order reconstruction for Meshfree Particle Methods in Numerical Flow Simulation.. Gilles-Alexis Renaut, Jean-Christophe Marongiu, Julien Leduc,

We present a numerical scheme for the approximation of Hamilton-Jacobi-Isaacs equations related to optimal control problems and differential games.. In the first case, the

Among fast methods, the prototype algorithm for the local single-pass class is the Fast Marching Method (FMM) [9, 12], while that for the iterative class is the Fast Sweeping

Key Words: Linear transport problems, L 2 -stable Petrov-Galerkin formulations, trace theorems, δ-proximality, adaptive refinement schemes, residual approximation, error