A TVD Active Flux method for scalar conservation laws

Wasilij Barsukow

Home/Archive/arXiv

arXiv · 2610.05920

A TVD Active Flux method for scalar conservation laws

Wasilij Barsukow

View original source ↗Read source document ↗Export metadata ↓

Abstract

Focusing on scalar conservation laws, a TVD theory is developed for the fully discrete, single-stage Active Flux method. The classical choice of degrees of freedom is considered, yielding a third-order method. Starting from an adaptation of the concept of (discrete) total variation to Active Flux, a corresponding adaptation of Harten's lemma is achieved. Finally, the high-order method is endowed with parameters chosen such that they can be efficiently computed to fulfill the conditions of the lemma.

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Wasilij Barsukow. 2026-10-05. A TVD Active Flux method for scalar conservation laws. https://arxiv.org/abs/2610.05920

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A nonlocal model for heterogeneous material flow on conveyor belts

In this paper, a finite volume approximation scheme is used to solve a nonlocal macroscopic material flow model in two space dimensions, accounting for the presence of boundaries in the nonlocal terms. Based on a previous result for the scalar case, we extend the setting to a system of heterogeneous material on bounded domains. We prove the convergence of the approximate solutions constructed using the Roe scheme with dimensional splitting. We consider a regularized version of the flux function and establish BV bounds for a Roe-type scheme. Numerical tests show a good agreement with microscopic simulations.

math.NA↗

arXiv2026

Algorithm XXXX: Computation of finite element degree-of-freedom transformation matrices

The arithmetic intensity of algorithms for computing finite element operators increases with increasing polynomial degree. This has made high degree methods particularly attractive on modern CPU and GPU architectures, since performance at low degree is limited by memory bandwidth and only a small fraction of the floating point capacity of the processor is used. Higher degree methods can exploit a significantly greater fraction of the available compute power. While stable methods for computing high-degree finite element bases are well-established, there is no universal and automated algorithm for the efficient construction of the degree-of-freedom map for arbitrary degree elements. We introduce a new algorithm that can be used in computing degree-of-freedom maps for arbitrary Ciarlet-type finite elements using only the element's definition and properties of the reference cell, without requiring a specific implementation for each element. This method is implemented in the library Basix, a component of the FEniCSx libraries. As well as allowing vast simplifications of parts of a codebase, the algorithm has allowed us to support user-defined custom elements that a user can create at runtime without requiring the user to input any information about transformations required to construct a degree-of-freedom map.

math.NA↗

arXiv2026

Geometry-Conforming Finite Element Methods for Interface Problems on Fitted and Unfitted Meshes

We develop an arbitrary-degree geometry-conforming finite element (GC-FE) framework for two-dimensional elliptic boundary value and interface problems on curved domains. Using the Frenet--Serret transformation, curved-boundary and interface-fitted segments are represented exactly, while polynomials in Frenet coordinates generate generally nonpolynomial local shape functions in physical coordinates. For interface-unfitted meshes, GC-FE spaces on curved-boundary elements are coupled with geometry-conforming immersed finite element (GC-IFE) spaces on interface-cut elements, with standard polynomial spaces used elsewhere. We establish optimal approximation, inverse, and trace estimates for the GC-FE spaces. For fitted meshes, we prove well-posedness and optimal error estimates in energy and $L^2$ norms for a symmetric interior penalty discontinuous Galerkin discretization. By retaining the prescribed curves exactly, the method avoids the geometric variational crime associated with curved-geometry approximation and requires no corresponding geometric consistency estimates. Numerical experiments confirm the predicted rates, show global accuracy comparable to nodal isoparametric finite elements and smaller true-interface trace errors in the reported tests, and demonstrate the coupled GC-FE-GC-IFE method on interface-unfitted meshes.

math.NA↗