SearcharxivSearch

arXiv · 2609.02721

A stable rank-adaptive step-and-truncate finite volume method for Vlasov transport on domains with piecewise linear boundaries

Abstract

We consider the numerical solution of the linear Vlasov transport equation on bounded spatial domains with inflow boundary conditions based on low-rank approximation. We combine a finite volume discretization with a rank-adaptive step-and-truncate scheme for the resulting matrix ODE. The spatial and velocity meshes may be unstructured, while suitable numerical fluxes retain a separated space-velocity representation. For homogeneous inflow, we show that the low-rank scheme inherits the $L_2$ stability and CFL restriction of the underlying full finite volume forward Euler method. In addition, the low-rank approximation error is bounded explicitly in terms of the truncation tolerances, avoiding the modeling error associated with tangent-space projections in dynamical low-rank approximation. Numerical experiments in 1d1v and 2d2v confirm the predicted error behavior. In 2d2v, the method handles an unstructured spatial mesh with nonzero inflow and a full tensor-product discretization of approximately $5.8\cdot10^{10}$ phase-space cells while the numerical rank is at most twelve.

Explore related subjects

Keep this discovery

BibTeXRIS

André Uschmajew, Andreas Zeiser. 2026-09-02. A stable rank-adaptive step-and-truncate finite volume method for Vlasov transport on domains with piecewise linear boundaries. https://arxiv.org/abs/2609.02721

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA