2016
DOI: 10.1016/j.jcp.2015.10.030
|View full text |Cite
|
Sign up to set email alerts
|

Numerical methods for high-dimensional probability density function equations

Abstract: 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 differen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
39
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 51 publications
(39 citation statements)
references
References 63 publications
0
39
0
Order By: Relevance
“…Among the various methods for UQ in PDEs, stochastic Galerkin (SG) methods based on generalized polynomial chaos (gPC) expansions are very attractive thanks to the spectral convergence property with respect to the random input [32,59,63,67,77,78,87,89]. On the other hand, their intrusive nature forces a complete reformulation of the problem and standard schemes for the corresponding deterministic problem cannot be used in a straightforward way.…”
Section: Stochastic Galerkin Methodsmentioning
confidence: 99%
“…Among the various methods for UQ in PDEs, stochastic Galerkin (SG) methods based on generalized polynomial chaos (gPC) expansions are very attractive thanks to the spectral convergence property with respect to the random input [32,59,63,67,77,78,87,89]. On the other hand, their intrusive nature forces a complete reformulation of the problem and standard schemes for the corresponding deterministic problem cannot be used in a straightforward way.…”
Section: Stochastic Galerkin Methodsmentioning
confidence: 99%
“…where I is the identity matrix, f n (z) = f (z, t n ), and τ n+1 (z) is the local truncation error of the Crank-Nicolson method at time t n+1 [63]. Rewriting this in a more compact notation yields [23] A…”
Section: Tensor Methods With Implicit Time Steppingmentioning
confidence: 99%
“…It arises in diverse areas of sciences as biology, finances, mechanics, and physics; see e.g. [12,13,15,24,19,16,25].…”
Section: The Liouville Equation and A Control Mechanismmentioning
confidence: 99%