Overcoming the curse of dimensionality in the numerical approximation of backward stochastic differential equations

08/24/2021
by   Martin Hutzenthaler, et al.
0

Backward stochastic differential equations (BSDEs) belong nowadays to the most frequently studied equations in stochastic analysis and computational stochastics. BSDEs in applications are often nonlinear and high-dimensional. In nearly all cases such nonlinear high-dimensional BSDEs cannot be solved explicitly and it has been and still is a very active topic of research to design and analyze numerical approximation methods to approximatively solve nonlinear high-dimensional BSDEs. Although there are a large number of research articles in the scientific literature which analyze numerical approximation methods for nonlinear BSDEs, until today there has been no numerical approximation method in the scientific literature which has been proven to overcome the curse of dimensionality in the numerical approximation of nonlinear BSDEs in the sense that the number of computational operations of the numerical approximation method to approximatively compute one sample path of the BSDE solution grows at most polynomially in both the reciprocal 1/ ε of the prescribed approximation accuracy ε∈ (0,∞) and the dimension d∈ℕ={1,2,3,…} of the BSDE. It is the key contribution of this article to overcome this obstacle by introducing a new Monte Carlo-type numerical approximation method for high-dimensional BSDEs and by proving that this Monte Carlo-type numerical approximation method does indeed overcome the curse of dimensionality in the approximative computation of solution paths of BSDEs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2019

Numerical meshless solution of high-dimensional sine-Gordon equations via Fourier HDMR-HC approximation

In this paper, an implicit time stepping meshless scheme is proposed to ...
research
10/15/2021

Strong L^p-error analysis of nonlinear Monte Carlo approximations for high-dimensional semilinear partial differential equations

Full-history recursive multilevel Picard (MLP) approximation schemes hav...
research
09/29/2020

Nonlinear Monte Carlo methods with polynomial runtime for high-dimensional iterated nested expectations

The approximative calculation of iterated nested expectations is a recur...
research
09/05/2020

Multilevel Picard approximations for high-dimensional semilinear second-order PDEs with Lipschitz nonlinearities

The recently introduced full-history recursive multilevel Picard (MLP) a...
research
10/03/2020

Deep Learning algorithms for solving high dimensional nonlinear Backward Stochastic Differential Equations

We study deep learning-based schemes for solving high dimensional nonlin...
research
12/10/2021

Frozen Gaussian Sampling: A Mesh-free Monte Carlo Method For Approximating Semiclassical Schrödinger Equations

In this paper, we develop a Monte Carlo algorithm named the Frozen Gauss...

Please sign up or login with your details

Forgot password? Click here to reset