Stochastic Methods for Solving High-Dimensional Partial Differential Equations

  title={Stochastic Methods for Solving High-Dimensional Partial Differential Equations},
  author={Marie Billaud-Friess and Arthur Macherey and Anthony Nouy and Cl{\'e}mentine Prieur},
  journal={arXiv: Numerical Analysis},
We propose algorithms for solving high-dimensional Partial Differential Equations (PDEs) that combine a probabilistic interpretation of PDEs, through Feynman-Kac representation, with sparse interpolation. Monte-Carlo methods and time-integration schemes are used to estimate pointwise evaluations of the solution of a PDE. We use a sequential control variates algorithm, where control variates are constructed based on successive approximations of the solution of the PDE. Two different algorithms… Expand
1 Citations

Figures and Tables from this paper

Algorithms for Solving High Dimensional PDEs: From Nonlinear Monte Carlo to Machine Learning
It is demonstrated to the reader that studying PDEs as well as control and variational problems in very high dimensions might very well be among the most promising new directions in mathematics and scientific computing in the near future. Expand


Deep Learning-Based Numerical Methods for High-Dimensional Parabolic Partial Differential Equations and Backward Stochastic Differential Equations
We study a new algorithm for solving parabolic partial differential equations (PDEs) and backward stochastic differential equations (BSDEs) in high dimension, which is based on an analogy between theExpand
Sequential Control Variates for Functionals of Markov Processes
A sequential control variates algorithm is used to compute Monte Carlo approximations of solutions of linear partial differential equations connected to linear Markov processes by the Feynman--Kac formula, showing the efficiency of the method on elliptic and parabolic problems. Expand
Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs*
Partial differential equations with random input data, such as random loadings and coefficients, are reformulated as parametric, deterministic PDEs on parameter spaces of high, possibly infinite dimension to derive representation of the random solutions' laws on infinite-dimensional parameter spaces in terms of ‘generalized polynomial chaos’ (GPC) series. Expand
An ‘empirical interpolation’ method: application to efficient reduced-basis discretization of partial differential equations
Abstract We present an efficient reduced-basis discretization procedure for partial differential equations with nonaffine parameter dependence. The method replaces nonaffine coefficient functionsExpand
Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
The numerical approximation of parametric partial differential equations is a computational challenge, in particular when the number of involved parameter is large. This paper considers a model classExpand
High-Dimensional Adaptive Sparse Polynomial Interpolation and Applications to Parametric PDEs
An interpolation technique in which the sample set is incremented as the polynomial dimension increases, leading therefore to a minimal amount of PDE solving, which is based on the standard principle of tensorisation of a one-dimensional interpolation scheme and sparsification. Expand
Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems
A fast algorithm for the discrete transform between the values at the sparse grid and the coefficients of expansion in a hierarchical basis is developed; and by using the aforementioned fast transform, two very efficient sparse spectral-Galerkin methods for a model elliptic equation are constructed. Expand
Numerical Solution of Stochastic Differential Equations
1. Probability and Statistics.- 2. Probability and Stochastic Processes.- 3. Ito Stochastic Calculus.- 4. Stochastic Differential Equations.- 5. Stochastic Taylor Expansions.- 6. Modelling withExpand
An Adaptive Sparse Grid Algorithm for Elliptic PDEs with Lognormal Diffusion Coefficient
In this work we build on the classical adaptive sparse grid algorithm (T. Gerstner and M. Griebel, Dimension-adaptive tensor-product quadrature), obtaining an enhanced version capable of usingExpand
Machine Learning Approximation Algorithms for High-Dimensional Fully Nonlinear Partial Differential Equations and Second-order Backward Stochastic Differential Equations
This work proposes a new method for solving high-dimensional fully nonlinear second-order PDEs and shows the efficiency and the accuracy of the method in the cases of a 100-dimensional Black–Scholes–Barenblatt equation, a100-dimensional Hamilton–Jacobi–Bellman equation, and a nonlinear expectation of a 200-dimensional G-Brownian motion. Expand