Abstract

This article deals with the numerical approximation of Markovian backward stochastic differential equations (BSDEs) with generators of quadratic growth with respect to zz and bounded terminal conditions. We first study a slight modification of the classical dynamic programming equation arising from the time-discretization of BSDEs. By using a linearization argument and BMO martingales tools, we obtain a comparison theorem, a priori estimates and stability results for the solution of this scheme. Then we provide a control on the time-discretization error of order 12−ε\frac{1}{2}-\varepsilon for all ε>0\varepsilon>0. In the last part, we give a fully implementable algorithm for quadratic BSDEs based on quantization and illustrate our convergence results with numerical examples.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.