相关论文: The Vlasov-Fokker-Planck Equation with High Dimens…
In neuroscience, the distribution of a decision time is modelled by means of a one-dimensional Fokker--Planck equation with time-dependent boundaries and space-time-dependent drift. Efficient approximation of the solution to this equation…
We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved…
We introduce a high-order finite element method for approximating the Vlasov-Poisson equations. This approach employs continuous Lagrange polynomials in space and explicit Runge-Kutta schemes for time discretization. To stabilize the…
Kinetic equations are difficult to solve numerically due to their high dimensionality. A promising approach for reducing computational cost is the dynamical low-rank algorithm, which decouples the dimensions of the phase space by proposing…
Solving high-dimensional Fokker-Planck (FP) equations is a challenge in computational physics and stochastic dynamics, due to the curse of dimensionality (CoD) and unbounded domains. Existing deep learning approaches, such as…
The Fokker-Planck equation describes the evolution of the probability density associated with a stochastic differential equation. As the dimension of the system grows, solving this partial differential equation (PDE) using conventional…
The numerical solution of high dimensional Vlasov equation is usually performed by particle-in-cell (PIC) methods. However, due to the well-known numerical noise, it is challenging to use PIC methods to get a precise description of the…
In this work, we consider optimal control problems constrained by elliptic partial differential equations (PDEs) with lognormal random coefficients, which are represented by a countably infinite-dimensional random parameter with i.i.d.…
In this work, we develop and rigorously analyze a new class of particle methods for the magnetized Vlasov--Poisson--Fokker--Planck system. The proposed approach addresses two fundamental challenges: (1) the curse of dimensionality, which we…
We propose the novel numerical scheme for solution of the multidimensional Fokker-Planck equation, which is based on the Chebyshev interpolation and the spectral differentiation techniques as well as low rank tensor approximations, namely,…
We consider a 1D-2V Vlasov-Fokker-Planck multi-species ionic description coupled to fluid electrons. We address temporal stiffness with implicit time stepping, suitably preconditioned. To address temperature disparity in time and space, we…
A high order, deterministic direct numerical method is proposed for the nonrelativistic $2D_{\bf x} \times 3D_{\bf v}$ Vlasov-Maxwell system, coupled with Fokker-Planck-Landau type operators. Such a system is devoted to the modelling of…
Randomized Fast Subspace Descent (RFASD) Methods are developed and analyzed for smooth and non-constraint convex optimization problems. The efficiency of the method relies on a space decomposition which is stable in $A$-norm, and meanwhile,…
The Vlasov-Fokker-Planck equation describes the evolution of the probability density of the position and velocity of particles under the influence of external confinement, interaction, friction, and stochastic force. It is well-known that…
High-resolution simulations of particle-based kinetic plasma models typically require a high number of particles and thus often become computationally intractable. This is exacerbated in multi-query simulations, where the problem depends on…
In this paper, we construct unique, local-in-time strong solutions to the Vlasov-Poisson (VP) and Vlasov-Poisson-Fokker-Planck (VPFP) systems subjected to external, spatially regular, white-in-time electromagnetic fields in $\mathbb T^d…
An adaptive method for parabolic partial differential equations that combines sparse wavelet expansions in time with adaptive low-rank approximations in the spatial variables is constructed and analyzed. The method is shown to converge and…
Dynamic Programming (DP) suffers from the well-known ``curse of dimensionality'', further exacerbated by the need to compute expectations over process noise in stochastic models. This paper presents a Monte Carlo-based sampling approach for…
We propose a new randomized optimization method for high-dimensional problems which can be seen as a generalization of coordinate descent to random subspaces. We show that an adaptive sampling strategy for the random subspace significantly…
A new approximation format for solutions of partial differential equations depending on infinitely many parameters is introduced. By combining low-rank tensor approximation in a selected subset of variables with a sparse polynomial…