相关论文: Conservative semi-Lagrangian schemes for kinetic e…

Exact procedures that follow Dirac's constraint quantization of gauge theories are usually technically involved and often difficult to implement in practice. We overview an "effective" scheme for obtaining the leading order semiclassical…

In this paper, we develop a class of high order conservative semi-Lagrangian (SL) discontinuous Galerkin (DG) methods for solving multi-dimensional linear transport equations. The methods rely on a characteristic Galerkin weak formulation,…

In this paper, "chance optimization" problems are introduced, where one aims at maximizing the probability of a set defined by polynomial inequalities. These problems are, in general, nonconvex and computationally hard. With the objective…

This paper is concerned with the numerical integration in time of nonlinear Schr\"odinger equations using different methods preserving the energy or a discrete analog of it. The Crank-Nicolson method is a well known method of order 2 but is…

This minicourse contains a description of recent results on the modelling of rarefied gases in weakly non equilibrium regimes, and the numerical methods used to approximate the resulting equations. Therefore this work focuses on BGK type…

Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and…

Several relaxation approximations to partial differential equations have been recently proposed. Examples include conservation laws, Hamilton-Jacobi equations, convection-diffusion problems, gas dynamics problems. The present paper focuses…

In this paper, a novel high order semi-Lagrangian (SL) spectral volume (SV) method is proposed and studied for nonlinear Vlasov-Poisson (VP) simulations via operator splitting. The proposed algorithm combines both advantages of…

This work is devoted to the numerical simulation of a Vlasov-Poisson model describing a charged particle beam under the action of a rapidly oscillating external electric field. We construct an Asymptotic Preserving numerical scheme for this…

In this work we study a multi-step scheme on time-space grids proposed by W. Zhao et al. [28] for solving backward stochastic differential equations, where Lagrange interpolating polynomials are used to approximate the time-integrands with…

Dynamical low-rank approximation, as has been demonstrated recently, can be extremely efficient in solving kinetic equations. However, a major deficiency is that they do not preserve the structure of the underlying physical problem. For…

The primary challenge in solving kinetic equations, such as the Vlasov equation, is the high-dimensional phase space. In this context, dynamical low-rank approximations have emerged as a promising way to reduce the high computational cost…

In this paper, we design a novel class of arbitrarily high-order structure-preserving numerical schemes for the time-dependent Gross-Pitaevskii equation with angular momentum rotation in three dimensions. Based on the idea of the scalar…

We propose a semi-proximal augmented Lagrangian based decomposition method for convex composite quadratic conic programming problems with primal block angular structures. Using our algorithmic framework, we are able to naturally derive…

In the second part of this series, we use the Lagrange multiplier approach proposed in the first part \cite{CheS21} to construct efficient and accurate bound and/or mass preserving schemes for a class of semi-linear and quasi-linear…

Inspired by the vectorial lattice Boltzmann method for linear elastodynamics \citep{boolakee2025linear}, we construct a total-Lagrangian vectorial lattice Boltzmann formulation for two-dimensional finite-strain hyperelastic dynamics. The…

A new algorithm for solving large-scale convex optimization problems with a separable objective function is proposed. The basic idea is to combine three techniques: Lagrangian dual decomposition, excessive gap and smoothing. The main…

Dynamical low-rank approximation (DLRA) is an emerging tool for reducing computational costs and provides memory savings when solving high-dimensional problems. In this work, we propose and analyze a semi-implicit dynamical low-rank…

We derive and analyze numerical methods for underdamped (kinetic) Langevin dynamics in a domain with elastic reflection at the boundary. First-order approximations are based on an Euler-type scheme incorporating collision-handling at the…

In this study, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the…