Numerical methods for high dimensional probability density function equations
In this paper we address the problem of computing the numerical solution to kinetic partial differential equations involving many phase variables. These types of equations arise naturally in many different areas of mathematical physics, e.g. in particle systems (Liouville and Boltzmann equations) stochastic dynamical systems (Fokker Planck and Dostupov Pugachev equations) random wave theory (Malakhov Saichev equations) and coarse grained stochastic systems (Mori Zwanzig equations) We propose three different classes of new algorithms addressing high dimensionality: The first one is based on separated series expansions resulting in a sequence of low dimensional problems that can be solved recursively and in parallel by using alternating direction methods. The second class of algorithms relies on truncation of interaction in low orders that resembles the Bogoliubov Born Green Kirkwood Yvon (BBGKY) framework of kinetic gas theory and it yields a hierarchy of coupled probability density function equations. The third class of algorithms is based on high dimensional model representations, e.g. the ANOVA method and probabilistic collocation methods. A common feature of all these approaches is that they are reducible to the problem of computing the solution to high dimensional equations via a sequence of low dimensional problems. The effectiveness of the new algorithms is demonstrated in numerical examples involving nonlinear stochastic dynamical systems and partial differential equations, with up to 120 variables.
J. Comput. Phys.