Numerical Algorithms for 1-d Backward Stochastic Differential Equations: Convergence and Simulations∗ a,c b,c Shige PENG Mingyu XU † aSchool of Mathematics and System Science, Shandong University, 250100, Jinan, China bInstitute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100080, China. cDepartment of Financial Mathematics and Control science, School of Mathematical Science, Fudan University, Shanghai, 200433, China. March 12, 2008 Abstract In this paper we study different algorithms for backward stochastic differential equations (BSDE in short) basing on random walk framework for 1-dimensional Brownian motion. Implicit and explicit schemes for both BSDE and reflected BSDE are introduced. Then we prove the convergence of different algorithms and present simulation results for different types of BSDEs. Keywords: Backward Stochastic Differential Equations, Reflected Stochastic Differential Equations with one barrier, Numerical algorithm, Numerical simulation arXiv:math/0611864v5 [math.PR] 23 Sep 2009 AMS: 60H10, 34K28 1 Introduction Non-linear backward stochastic differential equations (BSDEs in short) were firstly intro- duced by Pardoux and Peng ([20], 1990), who proved the existence and uniqueness of the adapted solution, under smooth square integrability assumptions on the coefficient and the terminal condition, and when the coefficient g(t,ω,y,z) is Lipschitz in (y, z) uniformly in (t, ω). From then on, the theory of backward stochastic differential equations (BSDE) has ∗This work is supported by the National Basic Research Program of China (973 Program), No. 2007CB814902 and No. 2007CB814906. †Corresponding author, Email :
[email protected] 1 been widely and rapidly developed. And many problems in mathematical finance can be treated as BSDEs.