arrow
Return

Numerical methods for high-dimensional probability density function equations

delete2016-01-01
delete44
delete
OA
AI
H
Heyrim Cho
D
Daniele Venturi
G
George Em Karniadakis *
DOI:10.1016/j.jcp.2015.10.030delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
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. (C) 2015 Elsevier Inc. All rights reserved.
Keywords:
High-order numerical methods
Proper generalized decomposition
Uncertainty quantification
Stochastic dynamical systems
Kinetic partial differential equations
ANOVA decomposition
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Computational Physics cover
Journal of Computational Physics
IF:
3.8
Papers:
1.6W
Citations:
7.4W

Organization

B
Brown University
Scholars:
2.4W
Papers: 2.2W
Citations: 3.2W
University System of Maryland cover
University System of Maryland
Scholars:
6.5W
Papers: 5.6W
Citations: 113
Cited Papers

Cited Papers

Efficient input-output model representations
err1999-03-01
err403
PREAI
errRabitz, H; Alis, ÖF; Shorter, J; Shim, K
errShare
errSave
errShare
errSave
errShare
errSave
Soft Statistical Mechanics for Biology
err2022-05-05
err0
PREAI
errMariano Bizzarri; Alessandro Giuliani
errShare
errSave
researcher View more