TY - JOUR

T1 - An efficient implementation of mass conserving characteristic-based schemes in two and three dimensions

AU - Cheng, Hanz Martin

AU - Droniou, Jérôme

PY - 2020

Y1 - 2020

N2 - In this paper, we develop the ball-approximated characteristics (B-char) method, which is an algorithm for efficiently implementing characteristic-based schemes in two and three dimensions. Core to the implementation of numerical schemes is the evaluation of integrals, which in the context of characteristic-based schemes with piecewise constant approximations boils down to computing the intersections between two regions. In the literature, these regions are approximated by polytopes (polygons in two dimensions and polyhedra in three dimensions) and, due to this, the implementation in three dimensions is nontrivial. The main novelty in this paper is the approximation of the regions by balls, whose intersections are much cheaper to compute than those of polytopes. Of course, balls cannot fully tessellate a region, and hence some mass may be lost. We perform some adjustments, and also solve an optimization problem, in order to yield a scheme that is both locally and globally mass conserving. This algorithm can achieve results that are similar to those obtained from an implementation which uses polytopal intersections, with a much cheaper computational cost.

AB - In this paper, we develop the ball-approximated characteristics (B-char) method, which is an algorithm for efficiently implementing characteristic-based schemes in two and three dimensions. Core to the implementation of numerical schemes is the evaluation of integrals, which in the context of characteristic-based schemes with piecewise constant approximations boils down to computing the intersections between two regions. In the literature, these regions are approximated by polytopes (polygons in two dimensions and polyhedra in three dimensions) and, due to this, the implementation in three dimensions is nontrivial. The main novelty in this paper is the approximation of the regions by balls, whose intersections are much cheaper to compute than those of polytopes. Of course, balls cannot fully tessellate a region, and hence some mass may be lost. We perform some adjustments, and also solve an optimization problem, in order to yield a scheme that is both locally and globally mass conserving. This algorithm can achieve results that are similar to those obtained from an implementation which uses polytopal intersections, with a much cheaper computational cost.

KW - Advection equation

KW - Ball-approximated characteristics

KW - Characteristic-based schemes

KW - ELLAM

KW - Eulerian Lagrangian localized adjoint method

UR - http://www.scopus.com/inward/record.url?scp=85084487731&partnerID=8YFLogxK

U2 - 10.1137/19M1281812

DO - 10.1137/19M1281812

M3 - Article

VL - 42

SP - A1071-A1096

JO - SIAM Journal on Scientific Computing

JF - SIAM Journal on Scientific Computing

SN - 1064-8275

IS - 2

ER -