Table of Contents
Fetching ...

Numerical approximation of ergodic BSDEs using non linear Feynman-Kac formulas

Emmanuel Gobet, Adrien Richou, Lukasz Szpruch

TL;DR

This work puts forward a new representation of the PDE solution by using a classical probabilistic representation of the gradient, and proposes a fully implementable numerical scheme using a Picard iteration procedure, a grid space discretization and a Monte-Carlo approximation.

Abstract

In this work we study the numerical approximation of a class of ergodic Backward Stochastic Differential Equations. These equations are formulated in an infinite horizon framework and provide a probabilistic representation for elliptic Partial Differential Equations of ergodic type. In order to build our numerical scheme, we put forward a new representation of the PDE solution by using a classical probabilistic representation of the gradient. Then, based on this representation, we propose a fully implementable numerical scheme using a Picard iteration procedure, a grid space discretization and a Monte-Carlo approximation. Up to a limiting technical condition that guarantees the contraction of the Picard procedure, we obtain an upper bound for the numerical error. We also provide some numerical experiments that show the efficiency of this approach for small dimensions.

Numerical approximation of ergodic BSDEs using non linear Feynman-Kac formulas

TL;DR

This work puts forward a new representation of the PDE solution by using a classical probabilistic representation of the gradient, and proposes a fully implementable numerical scheme using a Picard iteration procedure, a grid space discretization and a Monte-Carlo approximation.

Abstract

In this work we study the numerical approximation of a class of ergodic Backward Stochastic Differential Equations. These equations are formulated in an infinite horizon framework and provide a probabilistic representation for elliptic Partial Differential Equations of ergodic type. In order to build our numerical scheme, we put forward a new representation of the PDE solution by using a classical probabilistic representation of the gradient. Then, based on this representation, we propose a fully implementable numerical scheme using a Picard iteration procedure, a grid space discretization and a Monte-Carlo approximation. Up to a limiting technical condition that guarantees the contraction of the Picard procedure, we obtain an upper bound for the numerical error. We also provide some numerical experiments that show the efficiency of this approach for small dimensions.
Paper Structure (33 sections, 10 theorems, 96 equations, 5 figures, 1 table)

This paper contains 33 sections, 10 theorems, 96 equations, 5 figures, 1 table.

Key Result

Proposition 2.1

Let us assume that Assumptions eq:generatorfandb or eq:generatorfandb' are in force. Then the ergodic BSDE eq:EBSDE has a solution $(Y,Z,\lambda)$ such that for two measurable functions satisfying the growth Moreover, the solution $(Y,Z,\lambda)$ is unique (up to a constant for $Y$) in the class of Markovian solutions with previous growth.

Figures (5)

  • Figure 1: Solution $v$ at different iterations. Parameters: $d=1$, $\gamma=1$, $a=2$, $\theta=1.8$, $\widetilde{N}=10$, $\delta=0.2$, $M=10^5$.
  • Figure 2: Box plots of log-sup errors $\mathfrak{E}^{d,r}_{\infty,n}$ (with $d=1$, $r=1$) for different $n$, as a function of $\gamma$. Parameters: $a=2$, $\theta=1.8$, $\widetilde{N}=10$, $\delta=0.2$, $M=10^5$.
  • Figure 3: Box plots of log-sup errors $\mathfrak{E}^{d,r}_{\infty,n}$ (with $d=1$, $r=1$) for different $n$, as a function of $\theta$. Parameters: $a=2$, $\gamma=1$, $\widetilde{N}=10$, $\delta=0.2$, $M=10^5$.
  • Figure 4: Box plots of log-sup error $\mathfrak{E}^{d,r}_{\infty,n}$ (with $d=2$) for different $n$, as a function of $\gamma$. On the left $r=1$, on the right: $r=2$. Other parameters: $a=2$, $\theta=2$, $\widetilde{N}=10$, $\delta=0.2$, $M=10^5$.
  • Figure 5: Box plots of log grid errors $\mathcal{E}^{d,r}_{n}$ (with $d=1,2, 3, 4, 5$, $r=0, 1, 2$). Parameters: $a=2$, $\gamma=1$$\theta=1.8$, $\widetilde{N}=5$, $\delta=0.4$, $M=10^4$

Theorems & Definitions (23)

  • Proposition 2.1
  • proof
  • Proposition 2.2
  • proof
  • Theorem 2.1
  • Remark 2.1: Application to the approximation of BSDE in large horizon
  • Remark 2.2
  • Proposition 2.3
  • Proposition 2.4
  • Remark 2.3
  • ...and 13 more