pith. sign in

arxiv: 1103.3029 · v3 · pith:LW5S2XVYnew · submitted 2011-03-15 · 🧮 math.AP

A decomposition approach for the discrete-time approximation of FBSDEs with a jump I : the Lipschitz case

classification 🧮 math.AP
keywords fbsdesjumpbrowniancaseallowsapproachapproximationdiscrete-time
0
0 comments X
read the original abstract

We study the discrete-time approximation for solutions of forward-backward stochas- tic dierential equations (FBSDEs) with a jump. In this part, we study the case of Lipschitz generators, and we refer to the second part of this work [15] for the quadratic case. Our method is based on a result given in the companion paper [14] which allows to link a FBSDE with a jump with a recursive system of Brownian FBSDEs. Then we use the classical results on discretization of Brownian FBSDEs to approximate the recursive system of FBSDEs and we recombine these approximations to get a dis- cretization of the FBSDE with a jump. This approach allows to get a convergence rate similar to that of schemes for Brownian FBSDEs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.