activity
20072026
most citedDynamical low-rank approximation of the Vlasov-Poisson equation with piecewise linear spatial boundary

7 citations · 10 across the 6 of their papers we have counts for

collaborators

6 papers

math.NA2026

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

André Uschmajew, Andreas Zeiser

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…

math.NA2025

Discontinuous Galerkin discretization of conservative dynamical low-rank approximation schemes for the Vlasov-Poisson equation

André Uschmajew, Andreas Zeiser

A numerical dynamical low-rank approximation (DLRA) scheme for the solution of the Vlasov-Poisson equation is presented. Based on the formulation of the DLRA equations as Friedrich…

math.NA2023★ 7 cited

Dynamical low-rank approximation of the Vlasov-Poisson equation with piecewise linear spatial boundary

André Uschmajew, Andreas Zeiser

We consider dynamical low-rank approximation (DLRA) for the numerical simulation of Vlasov--Poisson equations based on separation of space and velocity variables, as proposed in se…

math.NA2022★ 1 cited

Sparse grid time-discontinuous Galerkin method with streamline diffusion for transport equations

Andreas Zeiser

High-dimensional transport equations frequently occur in science and engineering. Computing their numerical solution, however, is challenging due to its high dimensionality. In thi…

math.NA2007★ 1 cited

Adaptive Eigenvalue Computation - Complexity Estimates

W. Dahmen, T. Rohwedder, R. Schneider +1

This paper is concerned with the design and analysis of a fully adaptive eigenvalue solver for linear symmetric operators. After transforming the original problem into an equivalen…

math.NA2007★ 1 cited

Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization

Thorsten Rohwedder, Reinhold Schneider, Andreas Zeiser

In this paper we discuss an abstract iteration scheme for the calculation of the smallest eigenvalue of an elliptic operator eigenvalue problem. A short and geometric proof based o…