Andreas Zeiser
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Andreas Zeiser has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Reinhold Schneider
TU Berlin
3 shared publications - Thorsten Rohwedder
Sekretariat MA 5-3, Institut für Mathematik, TU Berlin, Straße des 17. Juni 136, 10623 Berlin, Germany
3 shared publications - André Uschmajew
Institute of Mathematics & Centre for Advanced Analytics and Predictive Sciences, University of Augsburg, Augsburg, Germany
2 shared publications Andreas Bartelt
1 shared publication- Bert Stegemann
School of Engineering—Energy and Information, HTW Berlin—University of Applied Sciences, Wilhelminenhofstr. 75a, 12459 Berlin, Germany
1 shared publication Christof Schultz
1 shared publication
Latest Publications
- Open Access
- 9 October 2025
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (4) , 1-38
Discontinuous Galerkin discretization of conservative dynamical low-rank approximation schemes for the Vlasov–Poisson equation
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 Friedrichs’ systems in a continuous setting, it combines recently proposed conservative DLRA methods with a discontinuous Galerkin discretization. The resulting scheme is shown to ensure mass and momentum conservation at the discrete level. In addition, a new formulation of the conservative integrator is proposed based on its interpretation as a tangent space projector splitting scheme. Numerical experiments validate our approach in one- and two-dimensional simulations of Landau damping. As a demonstration of feasibility, it is also shown that the rank-adaptive unconventional integrator can be combined with mesh adaptivity.
- 9 October 2025
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (4) , 1-38
Open AccessDiscontinuous Galerkin discretization of conservative dynamical low-rank approximation schemes for the Vlasov–Poisson equation
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 Friedrichs’ systems in a continuous setting, it combines recently proposed conservative DLRA methods with a discontinuous Galerkin discretization. The resulting scheme is shown to ensure mass and momentum conservation at the discrete level. In addition, a new formulation of the conservative integrator is proposed based on its interpretation as a tangent space projector splitting scheme. Numerical experiments validate our approach in one- and two-dimensional simulations of Landau damping. As a demonstration of feasibility, it is also shown that the rank-adaptive unconventional integrator can be combined with mesh adaptivity.
- Open Access
- 7 April 2024
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 64 (2) , 1-26
Dynamical low-rank approximation of the Vlasov–Poisson equation with piecewise linear spatial boundary
Dynamical low-rank approximation (DLRA) for the numerical simulation of Vlasov–Poisson equations is based on separation of space and velocity variables, as proposed in several recent works. The standard approach for the time integration in the DLRA model uses a splitting of the tangent space projector for the low-rank manifold according to the separated variables. It can also be modified to allow for rank-adaptivity. A less studied aspect is the incorporation of boundary conditions in the DLRA model. In this work, a variational formulation of the projector splitting is proposed which allows to handle inflow boundary conditions on spatial domains with piecewise linear boundary. Numerical experiments demonstrate the principle feasibility of this approach.
- 7 April 2024
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 64 (2) , 1-26
Open AccessDynamical low-rank approximation of the Vlasov–Poisson equation with piecewise linear spatial boundary
Dynamical low-rank approximation (DLRA) for the numerical simulation of Vlasov–Poisson equations is based on separation of space and velocity variables, as proposed in several recent works. The standard approach for the time integration in the DLRA model uses a splitting of the tangent space projector for the low-rank manifold according to the separated variables. It can also be modified to allow for rank-adaptivity. A less studied aspect is the incorporation of boundary conditions in the DLRA model. In this work, a variational formulation of the projector splitting is proposed which allows to handle inflow boundary conditions on spatial domains with piecewise linear boundary. Numerical experiments demonstrate the principle feasibility of this approach.
- Open Access
Sparse grid time-discontinuous Galerkin method with streamline diffusion for transport equations
High-dimensional transport equations frequently occur in science and engineering. Computing their numerical solution, however, is challenging due to its high dimensionality. In this work we develop an algorithm to efficiently solve the transport equation in moderately complex geometrical domains using a Galerkin method stabilized by streamline diffusion. The ansatz spaces are a tensor product of a sparse grid in space and discontinuous piecewise polynomials in time. Here, the sparse grid is constructed upon nested multilevel finite element spaces to provide geometric flexibility. This results in an implicit time-stepping scheme which we prove to be stable and convergent. If the solution has additional mixed regularity, the convergence of a $2d$-dimensional problem equals that of a $d$-dimensional one up to logarithmic factors. For the implementation, we rely on the representation of sparse grids as a sum of anisotropic full grid spaces. This enables us to store the functions and to carry out the computations on a sequence regular full grids exploiting the tensor product structure of the ansatz spaces. In this way existing finite element libraries and GPU acceleration can be used. The combination technique is used as a preconditioner for an iterative scheme to solve the transport equation on the sequence of time strips. Numerical tests show that the method works well for problems in up to six dimensions. Finally, the method is also used as a building block to solve nonlinear Vlasov-Poisson equations.
Open AccessSparse grid time-discontinuous Galerkin method with streamline diffusion for transport equations
High-dimensional transport equations frequently occur in science and engineering. Computing their numerical solution, however, is challenging due to its high dimensionality. In this work we develop an algorithm to efficiently solve the transport equation in moderately complex geometrical domains using a Galerkin method stabilized by streamline diffusion. The ansatz spaces are a tensor product of a sparse grid in space and discontinuous piecewise polynomials in time. Here, the sparse grid is constructed upon nested multilevel finite element spaces to provide geometric flexibility. This results in an implicit time-stepping scheme which we prove to be stable and convergent. If the solution has additional mixed regularity, the convergence of a $2d$-dimensional problem equals that of a $d$-dimensional one up to logarithmic factors. For the implementation, we rely on the representation of sparse grids as a sum of anisotropic full grid spaces. This enables us to store the functions and to carry out the computations on a sequence regular full grids exploiting the tensor product structure of the ansatz spaces. In this way existing finite element libraries and GPU acceleration can be used. The combination technique is used as a preconditioner for an iterative scheme to solve the transport equation on the sequence of time strips. Numerical tests show that the method works well for problems in up to six dimensions. Finally, the method is also used as a building block to solve nonlinear Vlasov-Poisson equations.
- Open Access
- 1 August 2023
- Published by Springer Nature in Partial Differential Equations and Applications
- Vol. 4 (4) , 1-25
Sparse grid time-discontinuous Galerkin method with streamline diffusion for transport equations
High-dimensional transport equations frequently occur in science and engineering. Computing their numerical solution, however, is challenging due to its high dimensionality. In this work we develop an algorithm to efficiently solve the transport equation in moderately complex geometrical domains using a Galerkin method stabilized by streamline diffusion. The ansatz spaces are a tensor product of a sparse grid in space and discontinuous piecewise polynomials in time. Here, the sparse grid is constructed upon nested multilevel finite element spaces to provide geometric flexibility. This results in an implicit time-stepping scheme which we prove to be stable and convergent. If the solution has additional mixed regularity, the convergence of a 2d-dimensional problem equals that of a d-dimensional one up to logarithmic factors. For the implementation, we rely on the representation of sparse grids as a sum of anisotropic full grid spaces. This enables us to store the functions and to carry out the computations on a sequence regular full grids exploiting the tensor product structure of the ansatz spaces. In this way existing finite element libraries and GPU acceleration can be used. The combination technique is used as a preconditioner for an iterative scheme to solve the transport equation on the sequence of time strips. Numerical tests show that the method works well for problems in up to six dimensions. Finally, the method is also used as a building block to solve nonlinear Vlasov-Poisson equations.
- 1 August 2023
- Published by Springer Nature in Partial Differential Equations and Applications
- Vol. 4 (4) , 1-25
Open AccessSparse grid time-discontinuous Galerkin method with streamline diffusion for transport equations
High-dimensional transport equations frequently occur in science and engineering. Computing their numerical solution, however, is challenging due to its high dimensionality. In this work we develop an algorithm to efficiently solve the transport equation in moderately complex geometrical domains using a Galerkin method stabilized by streamline diffusion. The ansatz spaces are a tensor product of a sparse grid in space and discontinuous piecewise polynomials in time. Here, the sparse grid is constructed upon nested multilevel finite element spaces to provide geometric flexibility. This results in an implicit time-stepping scheme which we prove to be stable and convergent. If the solution has additional mixed regularity, the convergence of a 2d-dimensional problem equals that of a d-dimensional one up to logarithmic factors. For the implementation, we rely on the representation of sparse grids as a sum of anisotropic full grid spaces. This enables us to store the functions and to carry out the computations on a sequence regular full grids exploiting the tensor product structure of the ansatz spaces. In this way existing finite element libraries and GPU acceleration can be used. The combination technique is used as a preconditioner for an iterative scheme to solve the transport equation on the sequence of time strips. Numerical tests show that the method works well for problems in up to six dimensions. Finally, the method is also used as a building block to solve nonlinear Vlasov-Poisson equations.
- Open Access
- 1 January 2022
- Published by Elsevier in Materials Today: Proceedings
- Vol. 53, 299-306
Laser-based series interconnection of chalcopyrite und perovskite solar cells: Analysis of material modifications and implications for achieving small dead area widths
- 1 January 2022
- Published by Elsevier in Materials Today: Proceedings
- Vol. 53, 299-306
Open AccessLaser-based series interconnection of chalcopyrite und perovskite solar cells: Analysis of material modifications and implications for achieving small dead area widths
- 21 September 2011
- Published by Springer Nature in Constructive Approximation
- Vol. 35 (3) , 293-322
Wavelet Approximation in Weighted Sobolev Spaces of Mixed Order with Applications to the Electronic Schrödinger Equation
- 21 September 2011
- Published by Springer Nature in Constructive Approximation
- Vol. 35 (3) , 293-322
Wavelet Approximation in Weighted Sobolev Spaces of Mixed Order with Applications to the Electronic Schrödinger Equation
- 26 November 2010
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 47 (3) , 328-346
Fast Matrix-Vector Multiplication in the Sparse-Grid Galerkin Method
- 26 November 2010
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 47 (3) , 328-346
Fast Matrix-Vector Multiplication in the Sparse-Grid Galerkin Method
- Open Access
Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
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 on the preconditioned inverse iteration (PINVIT) for matrices [Knyazev and Neymeyr, (2009)] is extended to the case of operators. We show that convergence is retained up to any tolerance if one only uses approximate applications of operators which leads to the perturbed preconditioned inverse iteration (PPINVIT). We then analyze the Besov regularity of the eigenfunctions of the Poisson eigenvalue problem on a polygonal domain, showing the advantage of an adaptive solver to uniform refinement when using a stable wavelet base. A numerical example for PPINVIT, applied to the model problem on the L-shaped domain, is shown to reproduce the predicted behaviour.
Open AccessPerturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
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 on the preconditioned inverse iteration (PINVIT) for matrices [Knyazev and Neymeyr, (2009)] is extended to the case of operators. We show that convergence is retained up to any tolerance if one only uses approximate applications of operators which leads to the perturbed preconditioned inverse iteration (PPINVIT). We then analyze the Besov regularity of the eigenfunctions of the Poisson eigenvalue problem on a polygonal domain, showing the advantage of an adaptive solver to uniform refinement when using a stable wavelet base. A numerical example for PPINVIT, applied to the model problem on the L-shaped domain, is shown to reproduce the predicted behaviour.
- 6 October 2009
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 34 (1) , 43-66
Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
- 6 October 2009
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 34 (1) , 43-66
Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
- 16 July 2008
- Published by Springer Nature in Numerische Mathematik
- Vol. 110 (3) , 277-312
Adaptive eigenvalue computation: complexity estimates
- 16 July 2008
- Published by Springer Nature in Numerische Mathematik
- Vol. 110 (3) , 277-312
Adaptive eigenvalue computation: complexity estimates