ﻻ يوجد ملخص باللغة العربية
We consider the Vlasov-Fokker-Planck equation with random electric field where the random field is parametrized by countably many infinite random variables due to uncertainty. At the theoretical level, with suitable assumption on the anisotropy of the randomness, adopting the technique employed in elliptic PDEs [Cohen, DeVore, 2015], we prove the best N approximation in the random space breaks the dimension curse and the convergence rate is faster than the Monte Carlo method. For the numerical method, based on the adaptive sparse polynomial interpolation (ASPI) method introduced in [Chkifa, Cohen, Schwab, 2014], we develop a residual-based adaptive sparse polynomial interpolation (RASPI) method which is more efficient for multi-scale linear kinetic equation, when using numerical schemes that are time-dependent and implicit. Numerical experiments show that the numerical error of the RASPI decays faster than the Monte-Carlo method and is also dimension independent.
Fractional Fokker-Planck equation plays an important role in describing anomalous dynamics. To the best of our knowledge, the existing discussions mainly focus on this kind of equation involving one diffusion operator. In this paper, we first derive
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 is required
We derive a diffusion approximation for the kinetic Vlasov-Fokker-Planck equation in bounded spatial domains with specular reflection type boundary conditions. The method of proof involves the construction of a particular class of test functions to b
In this work we consider an extension of a recently proposed structure preserving numerical scheme for nonlinear Fokker-Planck-type equations to the case of nonconstant full diffusion matrices. While in existing works the schemes are formulated in a
We propose an equilibrium-driven deformation algorithm (EDDA) to simulate the inbetweening transformations starting from an initial image to an equilibrium image, which covers images varying from a greyscale type to a colorful type on plane or manifo