An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions
From MaRDI portal
Abstract: In this paper, we develop the ball-approximated characteristics (B-char) method, which is an algorithm for efficiently implementing characteristic-based schemes in 2D and 3D. 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 2D and polyhedra in 3D) and, due to this, the implementation in 3D 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 optimisation 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.
Recommendations
- A Fully Mass and Volume Conserving Implementation of a Characteristic Method for Transport Problems
- Efficient implementation of characteristic-based schemes on unstructured triangular grids
- Characteristic Galerkin Schemes for Scalar Conservation Laws in Two and Three Space Dimensions
- An efficient characteristic Galerkin scheme for the advection equation in 3D.
Cites work
- scientific article; zbMATH DE number 3845535 (Why is no real title available?)
- scientific article; zbMATH DE number 1248865 (Why is no real title available?)
- scientific article; zbMATH DE number 194709 (Why is no real title available?)
- A Fully Mass and Volume Conserving Implementation of a Characteristic Method for Transport Problems
- A class of deformational flow test cases for linear transport problems on the sphere
- A combined GDM-ELLAM-MMOC scheme for advection dominated PDEs
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron
- A fully conservative Eulerian-Lagrangian method for a convection-diffusion problem in a solenoidal field
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
- A unified approach to mimetic finite difference, hybrid finite volume and mixed finite volume methods
- Algebraic flux correction for finite element approximation of transport equations
- An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
- Convergence analysis of a family of ELLAM schemes for a fully coupled model of miscible displacement in porous media
- Finding the intersection of two convex polyhedra
- Galerkin Finite Element Methods for Parabolic Problems
- High-Resolution Conservative Algorithms for Advection in Incompressible Flow
- On the numerical simulation of waterflooding of heterogeneous petroleum reservoirs
- Optimization-based mesh correction with volume and convexity constraints
- Optimization-based remap and transport: a divide and conquer strategy for feature-preserving discretizations
- Space sweep solves intersection of convex polyhedra
- Stability, monotonicity, maximum and minimum principles, and implementation of the volume corrected characteristic method
- The gradient discretisation method
Cited in
(1)
This page was built for publication: An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5112542)
