Next Article in Journal
Time-Varying Comovement of Foreign Exchange Markets: A GLS-Based Time-Varying Model Approach
Previous Article in Journal
Geometry of Bi-Warped Product Submanifolds of Nearly Trans-Sasakian Manifolds
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Weak Convergence Analysis and Improved Error Estimates for Decoupled Forward-Backward Stochastic Differential Equations

Faculty of Science, College of Statistics and Data Science, Beijing University of Technology, Beijing 100124, China
*
Author to whom correspondence should be addressed.
Submission received: 18 March 2021 / Revised: 6 April 2021 / Accepted: 11 April 2021 / Published: 13 April 2021

Abstract

:
In this paper, we mainly investigate the weak convergence analysis about the error terms which are determined by the discretization for solving the stochastic differential equation (SDE, for short) in forward-backward stochastic differential equations (FBSDEs, for short), which is on the basis of Itô Taylor expansion, the numerical SDE theory, and numerical FBSDEs theory. Under the weak convergence analysis of FBSDEs, we further establish better error estimates of recent numerical schemes for solving FBSDEs.

1. Introduction

This work is concerned with the forward-backward stochastic differential equations (FBSDEs) on ( Ω , F , F , P ) :
X t = X 0 + 0 t b ( s , X s ) d s + 0 t σ ( s , X s ) d W s , t [ 0 , T ] , ( F S D E )
Y t = ξ + t T f ( s , X s , Y s , Z s ) d s t T Z s d W s , t [ 0 , T ] , ( B S D E )
where t [ 0 , T ] , with T > 0 being the deterministic terminal time; ( Ω , F , F , P ) is a complete, filtered probability space with filtration F = ( F t ) 0 t T being the natural filtration of the standard d-dimensional Brownian motion W = ( W t ) 0 t T ; X 0 F 0 is the initial condition for the forward stochastic differential equation (FSDE); ξ = φ ( X T ) F T is the terminal condition for the backward stochastic differential equation (BSDE); the coefficients b: [ 0 , T ] × R q R q and σ : [ 0 , T ] × R q R q × d , the generator f: [ 0 , T ] × R q × R m × R m × d R m , and ( X t , Y t , Z t ) : [ 0 , T ] × Ω R q × R m × R m × d are unknown.
We point out that b ( · , x , y , z ) , σ ( · , x , y , z , ) , and f ( · , x , y , z ) are all F t -adapted for any fixed numbers x , y and z, and that the two stochastic integrals with respect to W s are of the Itô type. A triple ( X t , Y t , Z t ) is called an L 2 -adapted solution of the decoupled FBSDEs (1) and (2) if, in the probability space ( Ω , F , F , P ) , it is { F t } -adapted, square integrable, and satisfies the Equations (1) and (2).
FBSDEs have important applications in many fields, including mathematical finance, partial differential equations, stochastic controls, risk measure, and so on [1,2,3,4,5]. Thus, it is interesting and also important to find solutions of FBSDEs. Usually, it is difficult to get the analytical solutions in an explicit closed form. Thus, numerical methods for solving FBSDEs are desired, especially accurate, effective, and efficient ones. Many numerical schemes for solving BSDE and decoupled FBSDEs have been developed, among which some are numerical methods with low-order convergence rates [6,7,8,9,10] under lower regularity assumptions, while others are high-order numerical methods [11,12,13,14,15,16,17]. It is notable that most of the numerical methods are designed for BSDE, or decoupled FBSDEs. In those methods, the authors place more attention on the truncated error terms, thereby ignoring the errors which are caused by the discretization scheme for solving the SDE (1).
The main purpose of this work is to prove that the weak convergence analysis of the four error terms is determined by the discretization for solving the SDE (1). Our analysis invokes an Ito Taylor expansion, the numerical SDE theory, and the numerical FBSDEs theory. In Section 2, the high-order numerical scheme introduced in [16] is briefly reviewed. Section 3 firstly gives the stability analysis of the proposed Scheme in Section 2; then our main result, weak convergence analysis, together with some useful lemmas is presented; finally, under the weak convergence analysis of FBSDEs, we improve the error estimates about the Schemes [16,17]. Some concluding remarks are made in Section 4.
For a simple representation, let us first introduce the following notations:
  • | · | : the standard Euclidean norm in the Euclidean space R q , R m , and R m × d .
  • F s t , x ( t s T ) : the σ -field generated by the diffusion process { X r : t r s , X t = x } starting from the time-space point ( t , x ) . When s = T , we use F t , x to denote F T t , x .
  • E s t , x [ X ] : the conditional expectation of the random variable X under the σ -field F s t , x ( t s T ) , that is, E s t , x [ X ] = E [ X | F s t , x ] . Let E t x [ X ] = E [ X | F t t , x ] .
  • P i [ a , b ] : the set of polynomials of degree i defined on [ a , b ] .
  • C b k : the set of continuously differential functions ϕ : x R q R with uniformly bounded partial derivatives x k 1 ϕ for k 1 k .
  • C b l , k : the set of functions ϕ : ( t , x ) [ 0 , T ] × R q R with uniformly bounded partial derivatives t l 1 x k 1 ϕ for l 1 l and k 1 k .
  • C b l , k , k : the set of continuously differential functions ϕ : ( t , x , y ) [ 0 , T ] × R q × R R with uniformly bounded partial derivatives t l 1 ϕ and x k 1 y k 2 ϕ for l 1 l and k 1 + k 2 k .
  • C p k : the set of k times continuously differentiable functions ϕ : x R q R for which ϕ and all of its partial derivatives of orders up to and including k have polynomial growth.

2. Discretization

For the time interval [ 0 , T ] , we introduce the following partitions:
0 = t 0 < t 1 < < t N = T .
Let Δ t n = t n + 1 t n , n = 0 , 1 , , N 1 and Δ t = max 0 n N 1 Δ t n . We also assume that the time partitions have the following regularity:
max 0 n N 1 Δ t n min 0 n N 1 Δ t n c 0 ,
where c 0 1 is a constant.
Let ( X t , x , Y t , x , Z t , x ) be the solution of (1) and (2) with date ( t , x ) ; that is, ( X t , x , Y t , x , Z t , x ) satisfies
X s t , x = x + t s b ( r , X r t , x ) d r + t s σ ( r , X r t , x ) d W r , s [ t , T ] , Y s t , x = φ ( X T t , x ) + s T f ( r , X r t , x , Y r t , x , Z r t , x ) d r s T Z r t , x d W r , s [ t , T ] .

2.1. Reference Equations

To derive the reference equations, we first define the stochastic process
Δ W ˜ s = t n s ( 2 3 ( r t n ) Δ t n ) d W r , s [ t n , t n + 1 ) .
The process Δ W ˜ s = ( Δ W ˜ s 1 , Δ W ˜ s 2 , , Δ W ˜ s d ) is a martingale with the properties E t n X n [ Δ W ˜ s ] = 0 , E t n X n [ Δ W ˜ s i Δ W ˜ s j ] = 0 for i j , and
E t n X n [ ( Δ W ˜ s i ) 2 ] = 4 ( s t n ) 6 ( s t n ) 2 Δ t n + 3 ( s t n ) 3 Δ t n 2 .
Then when s = t n + 1 , we have E t n X n [ Δ W ˜ t n + 1 ] = 0 and E t n X n [ ( Δ W ˜ t n + 1 ) 2 ] = Δ t n .
Fixed n N , let Y t N t n , X n = φ ( X T t n , X n ) and ( X t t n , X n , Y t t n , X n , Z t t n , X n ) be the solution of (4) with X n = x for t [ t n , T ] . Denote f ( s , X s t n , X n , Y s t n , X n , Z s t n , X n ) by f s t n , X n , s [ t n , t n + 1 ) . Then it is easy to get that
X t n + 1 t n , X n = X n + t n t n + 1 b ( s , X s t n , X n ) d s + t n t n + 1 σ ( s , X s t n , X n ) d W s ,
Y t n t n , X n = Y t n + 1 t n , X n + t n t n + 1 f s t n , X n d s t n t n + 1 Z s t n , X n d W s ,
for n = 0 , 1 , , N 1 . The forward SDE (6) can be solved independently by existing numerical methods in the above decoupled case, and in this article, we use numerical schemes of the general form
X n + 1 = X n + ϕ ( t n , t n + 1 , X n , I α A β ) ,
where β represents the convergence rate in the strong or weak sense and A β denotes the corresponding hierarchical set; for more details on the notations, readers can be referred to [18]. Our main goal therefore turns to deducing the reference equations for Y t n t n , X n and Z t n t n , X n from the BSDE (7).
Since t n t Z s t n , X n d W s is a martingale for t > t n , by taking the conditional expectation E t n X n [ · ] on (7) we get
Y t n t n , X n = E t n X n [ Y t n + 1 t n , X n ] + t n t n + 1 E t n X n [ f s t n , X n ] d s .
Then, multiplying Equation (7) by Δ W ˜ t n + 1 * and taking the conditional mathematical expectation E t n X n [ · ] on both sides of the derived equation, we obtain
0 = E t n X n [ Y t n + 1 t n , X n Δ W ˜ t n + 1 * ] + t n t n + 1 E t n X n [ f s t n , X n Δ W ˜ t n + 1 * ] d s E t n X n [ t n t n + 1 Z s t n , X n d W s · Δ W ˜ t n + 1 * ] .
Under the filtration F t n the integrands in (9) and (10) are deterministic functions of s [ t n , t n + 1 ] , so some numerical integration methods for deterministic integration can be used to approximate these integrals.
First, we apply the trapezoidal rule to obtain
t n t n + 1 E t n X n [ f s t n , X n ] d s = 1 2 Δ t n f t n t n , X n + 1 2 Δ t n E t n X n [ f t n + 1 t n , X n ] + R y n ,
with the truncation error
R y n = t n t n + 1 E t n X n [ f s t n , X n ] 1 2 f t n t n , X n 1 2 E t n X n [ f t n + 1 t n , X n ] d s .
Inserting (11) into (9), we obtain the following reference equation for solving Y t n t n , X n :
Y t n t n , X n = E t n X n [ Y t n + 1 t n , X n ] + 1 2 Δ t n f t n t n , X n + 1 2 Δ t n E t n X n [ f t n + 1 t n , X n ] + R y n .
Next, for the first integral term on the right-hand side of (10), we easily get the identity
t n t n + 1 E t n X n [ f s t n , X n Δ W ˜ t n + 1 * ] d s = Δ t n E t n X n [ f t n + 1 t n , X n Δ W ˜ t n + 1 * ] + R 1 n ,
where R 1 n = t n t n + 1 E t n X n [ f s t n , X n Δ W ˜ t n + 1 * ] d s Δ t n E t n X n [ f t n + 1 t n , X n Δ W ˜ t n + 1 * ] . For the second integral term on the right-hand side of (10), we have
E t n X n [ t n t n + 1 Z s t n , X n d W s · Δ W ˜ t n + 1 * ] = Z t n t n , X n E t n X n [ Δ W t n + 1 Δ W ˜ t n + 1 * ] + R 2 n = 1 2 Δ t n Z t n t n , X n + R 2 n ,
where R 2 n = 1 2 Δ t n Z t n t n , X n E t n X n [ t n t n + 1 Z s t n , X n d W s · Δ W ˜ t n + 1 * ] . From Equations (10), (14) and (15), we obtain the following reference equation for solving Z t n t n , X n :
1 2 Δ t n Z t n t n , X n = E t n X n [ Y t n + 1 t n , X n Δ W ˜ t n + 1 * ] + Δ t n E t n X n [ f t n + 1 t n , X n Δ W ˜ t n + 1 * ] + R z n ,
where R z n = R 1 n + R 2 n .

2.2. Numerical Scheme

Now we propose a new numerical scheme for solving the decoupled FBSDEs (4). Let ( X n , Y n , Z n ) denote an approximation to the analytic solution ( X t , Y t , Z t ) of (4) at time t = t n , n = N , N 1 , , 0 . To simplify the presentation, we let f n = f ( t n , X n , Y n , Z n ) for n = N , N 1 , , 0 . Based on (13) and (16), we propose a numerical scheme, for solving the FBSDEs (4) as follows.
Scheme 1.
Given random variables X 0 , Y N and Z N . Let Δ W ˜ t n + 1 ( 0 n N 1 ) be defined by (5) with s = t n + 1 . For n = N 1 , N 2 , , 0 , solve random variables Y n and Z n by
Y n = E t n X n [ Y n + 1 ] + 1 2 Δ t n f n + 1 2 Δ t n E t n X n [ f n + 1 ] ,
1 2 Δ t n Z n = E t n X n [ Y n + 1 Δ W ˜ t n + 1 * ] + Δ t n E t n X n [ f n + 1 Δ W ˜ t n + 1 * ] .

3. Error Estimates

We now provide some theoretical analysis on the numerical stability and convergence of the Scheme 1. Let us denote by Y ˜ t n + 1 t n , X n and Z ˜ t n + 1 t n , X n the approximate values of Y t n + 1 t n , X n and Z t n + 1 t n , X n at the time-space ( t n + 1 , X n + 1 ) , respectively, where X n + 1 is the approximate solution of X t n + 1 t n , X n calculated by (8), that is, Y ˜ t n + 1 t n , X n = Y t n + 1 t n + 1 , X n + 1 and Z ˜ t n + 1 t n , X n = Z t n + 1 t n + 1 , X n + 1 . To simplify the presentation, we first introduce the following notation:
f ˜ t i t n , X n = f ( t i , X n + 1 , Y ˜ t i t n , X n , Z ˜ t i t n , X n ) ,
and e y i = Y ˜ t i t n , X n Y i , e z i = Z ˜ t i t n , X n Z i , e f i = f ˜ t i t n , X n f i , for i = n , , N , and
R y 1 n = E t n X n [ Y t n + 1 t n , X n Y ˜ t n + 1 t n , X n ] , R y 2 n = E t n X n [ f t n + 1 t n , X n f ˜ t n + 1 t n , X n ] , R z 1 n = E t n X n [ ( Y t n + 1 t n , X n Y ˜ t n + 1 t n , X n ) Δ W ˜ t n + 1 * ] , R z 2 n = E t n X n [ ( f t n + 1 t n , X n f ˜ t n + 1 t n , X n ) Δ W ˜ t n + 1 * ] ,
for i = n , , N 1 .

3.1. Stability Analysis

The following result on decoupled FBSDEs is well-known by now; for its proof, see Theorem 4.1 in [16] or Theorem 4.1 in [17].
Theorem 1.
Let ( X t , Y t , Z t ) , t [ 0 , T ] and ( X n , Y n , Z n ) , n = 0 , 1 , , N , be the exact solution of the decoupled FBSDEs (1) and (2) and the approximate solution obtained by Scheme 1, respectively. Assume that the function f ( t , x , y , z ) is Lipschitz-continuous with respect to x, y, and z, and the Lipschitz constant is L. Let c 0 be the time partitions regularity parameter defined in (3). Then, for the sufficiently small time-step Δ t n satisfying (3), it holds that
E [ | e y n | 2 ] + Δ t i = n N 1 1 + C Δ t 1 C Δ t i n E [ | e z i | 2 ] C E [ | e y N | 2 ] + Δ t E [ | e z N | 2 ] + i = n N 1 1 + C Δ t 1 C Δ t i n C E [ | R y 1 i | 2 + ( Δ t ) 2 | R y 2 i | 2 + | R y i | 2 ] Δ t ( 1 C Δ t ) + i = n N 1 1 + C Δ t 1 C Δ t i n C Δ t E [ ( 1 Δ t n ) 2 | R z 1 i | 2 + | R z 2 i | 2 + ( 1 Δ t n ) 2 | R z i | 2 ] 1 C Δ t ,
for n = N 1 , , 1 , 0 , where C is a positive constant depending on c 0 and L; C is also a positive constant depending on c 0 , T and L; and R y i and R z i are defined in (12) and (16), respectively.
Remark 1.
Theorem 1 implies that Scheme 1 is stable, and its solution continuously depends on terminal conditions; that is, for any given positive number ϵ, there exists a positive integer δ, for different terminal conditions ( Y ¯ N , Z ¯ N ) and ( Y N , Z N ) , if E [ | Y ¯ N Y N | 2 ] < δ and E [ | Z ¯ N Z N | 2 ] < δ , then for 0 n N 1 , we have
E [ | Y ¯ n Y n | 2 ] + Δ t i = n N E [ | Z ¯ i Z i | 2 ] < ϵ .
Remark 2.
The terms R y n and R z n in (12) and (16) come from the approximations in their reference equations for Y t n and Z t n . The four terms R y 1 n , R y 2 n , R z 1 n , and R z 2 n are determined by the discretizations (8) for solving the SDE in (6), which reflects the local errors (in the weak sense) of the numerical scheme for SDE. Under certain regularity conditions on b , σ , f , and φ, if we get estimates of these terms, a convergence result for the Scheme 1 can be obtained.
In the following lemmas, we will present estimations for R y n , R z n , R y 1 n , R y 2 n , R z 1 n , and R z 2 n under certain regularity conditions on b, σ , f and φ . For the sake of presentation simplicity, we only consider the case q = d = 1 , and the results obtained also hold true for general positive integers q and d. In order to get the estimates of R y 1 n , R y 2 n , R z 1 n and R z 2 n , we need the weak error estimate about the SDE in (16).

3.2. Weak Convergence Analysis

For the convenience, we use the following notions which appeared in [18].
  • Denote the set of all multi-indices by M ,
    M = { ( j 1 , j 2 , , j l ) : j i { 0 , 1 , 2 , , d } , i { 1 , 2 , , l } , for l = 1 , 2 , 3 , } { υ } .
  • Let l ( α ) : = l be the length of the multi-index α = ( j 1 , j 2 , , j l ) M , where j i { 0 , 1 , 2 , , d } for i { 1 , 2 , , l } , d = 1 , 2 , 3 , . Here, d is the number of components of the Wiener process W under consideration. For example: l ( ( 1 , 0 ) ) = 2 , l ( ( 1 , 0 , 0 ) ) = 3 .
  • Let n ( α ) be the number of components of a multi-index α which are equal to 0. For example: n ( ( 1 , 0 ) ) = 1 , n ( ( 1 , 0 , 0 ) ) = 2 .
  • For completeness, denote by υ the multi-index of length zero, that is, with l ( υ ) : = 0 .
  • If l ( α ) 1 , write α and α for the multi-index in M obtained by deleting the first and last component, respectively, of α . Thus, ( 1 , 0 ) = ( 0 ) , ( 1 , 0 ) = ( 1 ) .
  • Define α + to be the multi-index obtained from α by deleting all of the components equal to 0. For E , if α = ( 1 , 2 , 0 , 1 ) , then we have α + = ( 1 , 2 , 0 , 1 ) + = ( 1 , 2 , 1 ) .
  • Denote by k 0 ( α ) the number of components of α equal to 0 preceding the first nonzero component of α or until the end of α if all its components are zeros.
  • Denote by k i ( α ) , for i = 1 , , l ( α + ) , the number of components of α between the ith nonzero component and the ( i + 1 ) th nonzero component or the end of α if i = l ( α + ) . For example: α = ( 0 , 1 , 2 , 0 ) we have α + = ( 1 , 2 ) , l ( α + ) = 2 and k 0 ( α ) = 1 , k 1 ( α ) = 0 , k 2 ( α ) = 1 .
  • Define ω ( α , β ) : = l ( α + ) + i = 0 l ( α + ) ( k i ( α ) + k i ( β ) ) .
  • Let ρ and τ be two stopping times with 0 ρ τ T , w.p.1. Then, for a multi-index α = ( j 1 , j 2 , , j l ) M , and a process f H α the multi Itô integral I α [ f ( · ) ] ρ , τ is recursively defined by
    I α [ f ( · ) ] ρ , τ : = f ( τ ) : l = 0 , ρ τ I α [ f ( · ) ] ρ , s d s : l 1 and j l = 0 , ρ τ I α [ f ( · ) ] ρ , s d W s j l : l 1 and j l 1 .
    For α = ( j 1 , j 2 , , j l ) with l 2 the set H α is recursively defined to be the totality of adapted right continuous processes f = { f ( t ) , t 0 } with left-hand limits such that the integral process { I α [ f ( · ) ] ρ , t , t 0 } considered as a function of t satisfies I α [ f ( · ) ] ρ , · H ( j l ) . For E ,
    I α , [ t n , t n + 1 ] = t n t n + 1 t n s l t n s 2 d W s 1 j 1 d W s l 1 j l 1 d W s l j l ,
    where set d W s 0 = d s .
Based on the upper notations, we give the following lemmas which are valid for both scalar and vector functions. The reader interested in more details is also referred to [18].
Lemma 1.
Let α , β M and f H α , g H β . Then for 0 n N 1 we have -4.6cm0cm
E t n X n I α [ f ( · ) ] t n , t n + 1 , I β [ g ( · ) ] t n , t n + 1 = 0 : α + β + , l ( α + ) = l ( β + ) , K f , g ( Δ t ) ω ( α , β ) ω ( α , β ) ! Π i = 0 l ( α + ) C k i ( α ) + k i ( β ) k i ( α ) : α + = β + ,
with
K f , g = sup s 1 , s 2 [ t n , t n + 1 ] E t n X n [ | ( f ( s 1 ) , g ( s 2 ) ) | ] ,
where
C k i ( α ) + k i ( β ) k i ( α ) = ( k i ( α ) + k i ( β ) ) ! k i ( α ) ! k i ( β ) ! .
Moreover, (21) holds with equality when f g 1 .
The next lemma provides an estimate for the higher moments of a multiple Itô integral.
Lemma 2.
Let α M , g H α and q = 1 , 2 , . Then for 0 n N 1 we have the estimate
E t n X n | I α [ g ( · ) t n , t n + 1 ] | 2 q 1 / q 2 ( 2 q 1 ) e T l ( α ) n ( α ) ( Δ t ) l ( α ) + n ( α ) R ,
where R = E t n X n sup t n s t n + 1 | g ( s ) | 2 q 1 / q .
Next, we consider the coefficients of stochastic Itô-Taylor expansions. First, we write the definition of diffusion operator L 0 as
L 0 = t + k = 1 q b k x k + 1 2 k , l q j = 1 d σ k , j σ l , j 2 x k x l ,
and for j { 1 , , d } the operator L j as
L j = k = 1 q σ k , j x k .
For each α = ( j 1 , j 2 , , j l ) M and function f C h ( R + × R q , R ) with h = l ( α ) + n ( α ) we define recursively f α as
f α = f : l = 0 , L j 1 f α : l 0 .
In order to give weak Taylor expansion schemes, we use the following definitions:
  • Call a subset A M an hierarchical set if it satisfies:
    (1) A is nonempty: A ;
    (2) The multi-indices in A are uniformly bounded in length: sup α A l ( α ) < ;
    (3) α A for each α A { υ } .
  • For any given hierarchical set A define the remainder set B ( A ) of A by B ( A ) = { α M A : α A } .
In the general multi-dimensional case q , d = 1 , 2 , , for β = 1.0 , 2.0 , 3.0 , , define the weak Taylor scheme of order β by the vector equation
X n + 1 = X n + α Γ β { υ } f α ( t n , X n ) I α , [ t n , t n + 1 ] = X n + j = 0 d t n t n + 1 σ ¯ s j d W s j ,
with d W s 0 = d s and
σ ¯ t j = α Γ β { υ } j l ( α ) = j I α [ f α ( t n , X n ) ] t n , t n + 1 ,
for j = 0 , 1 , , d , where α = ( j 1 , j 2 , , j l ( α ) ) . Here, X t n = X n is assumed. The scheme (24) is obtained from
X t n + 1 t n , X n = X t n + α Γ β { ν } f α ( t n , X t n ) I α , [ t n , t n + 1 ] + R X n .
Here, R X n = α B ( Γ β ) I α [ f α ( · , X · t n , X n ) ] t n , t n + 1 , Γ β = { α M : l ( α ) β } is an hierarchical set, and B ( Γ β ) = { α M : l ( α ) = β + 1 } is the remainder set of Γ β .
We denote C P l ( R q , R ) by the space of l times continuously differentiable functions g : R q R for which g and all its derivatives of orders up to and including l have polynomial growth.
Lemma 3.
Let β { 1 , 2 , } be given and suppose that the coefficients b k belong to the space C P 2 ( β + 1 ) ( [ 0 , T ] × R q , R q ) and σ k , j belong to the space C P 2 ( β + 1 ) ( [ 0 , T ] × R q , R q × d ) and satisfy Lipschitz conditions and linear growth bounds for k = 1 , , q and j = 0 , 1 , , d . Then, for each g C P 2 ( β + 1 ) ( [ 0 , T ] × R q ) and for the sufficiently small time-step Δ t satisfying (3), there exist constants C ( 0 , ) and r { 1 , 2 , } such that
E t n X n [ sup 0 n N 1 | X t n + 1 t n , X n | 2 r ] C ( 1 + | X n | 2 r ) ,
and
sup 0 n N 1 | E t n X n [ g ( X t n + 1 t n , X n ) g ( X n + 1 ) ] | C ( 1 + | X n | 2 r ) ( Δ t ) β + 1 .
Lemma 4.
Under the conditions that Lemma 3 holds, then for the sufficiently small time-step Δ t n satisfying (3), we have that for any 0 n N 1 ,
E [ | R y 1 n | 2 ] C ( 1 + E [ | X 0 | 4 r ] ) ( Δ t ) 2 β + 2 , E [ | R y 2 n | 2 ] C ( 1 + E [ | X 0 | 4 r ] ) ( Δ t ) 2 β + 2 .
Proof. 
We know that
R y 1 n = E t n X n [ Y t n + 1 t n , X n Y ˜ t n + 1 t n , X n ] , R y 2 n = E t n X n [ f t n + 1 t n , X n f ˜ t n + 1 t n , X n ] .
Using Lemma 3, we can get the results directly.  □
In order to give the estimates of R z 1 n and R z 2 n , we need the following lemmas. Due to the complexity of the Itô Taylor expansion, we give some useful notations.
We write P l = { 1 , 2 , , q } l and
F p ( y ) = k = 1 l y p k ,
for all y = ( y 1 , y 2 , , y q ) and p = ( p 1 , , p l ) P l , l = 1 , 2 , .
Then starting from (24) and (29), by a generalization of the Itô formula to semi-martingales, we obtain
F p ( X n + 1 X n ) = j = 0 d t n t n + 1 σ ^ p j ( s ) d W s j ,
for all 0 n N 1 and p P l , l = 1 , 2 , , where
σ ^ p j ( t ) = k = 1 q σ ¯ t k , j x k F p ( X n + 1 X n ) ,
for j = 1 , 2 , , d and
σ ^ p 0 ( t ) = t F p ( X n + 1 X n ) + k = 1 q σ ¯ t k , 0 x k F p ( X n + 1 X n ) + 1 2 k , l = 1 q j = 1 d σ ¯ t k , j σ ¯ t l , j 2 x k x l F p ( X n + 1 X n ) .
Lemma 5.
Under the conditions of Lemma 3 for each p = 1 , 2 , and the sufficiently small time-step Δ t satisfying (3), there exist constants C ( 0 , ) and r { 1 , 2 , } such that
Z ^ ( t ) : = E t n X n sup 0 n N 1 | F p ( X n + 1 X n ) | 2 q C ( 1 + | X n | 2 r ) ( Δ t ) q l ,
for all q = 0 , 1 , , p · 2 2 ( β + 1 ) l and p P l where l = 1 , , 2 ( β + 1 ) .
To give an important proposition, first we need to prove the following lemma.
Lemma 6.
Under the conditions of Lemma 3, there exist constants C ( 0 , ) and r { 1 , 2 , } such that
F ^ ( t ) : = | E t n X n F p ( X t n + 1 t n , X n X t n ) F p ( X n + 1 X n ) Δ W ˜ t n + 1 | C ( 1 + | X n | 2 r ) ( Δ t ) β + 1 ,
for all p P l , l = 1 , 2 , , 2 ( β + 1 ) .
Proof. 
Step 1. The case l = 1 . In this case, p = ( k ) with k { 1 , 2 , , q } . Then by (23) and (29), we have
F ^ ( t ) = | E t n X n ( X t n + 1 t n , X n , k X n + 1 , k ) Δ W ˜ t n + 1 | = | α B ( Γ β ) E t n X n I α [ f α k ( · , X · t n , X n ) ] t n , t n + 1 i = 1 d I ( i ) [ P ( · ) ] t n , t n + 1 | α B ( Γ β ) i = 1 d | E t n X n I α [ f α k ( · , X · t n , X n ) ] t n , t n + 1 I ( i ) [ P ( · ) ] t n , t n + 1 | ,
where P ( · ) = 2 3 ( · t n ) Δ t n are the set of backward orthogonal polynomials on [ t n , t n + 1 ] from the definition of Δ W ˜ s in (5).
By Lemma 1, only the terms with α + = ( i ) in the sum on the right-hand side of the above inequality are not zero. For α + = ( i ) , it is easy to check ω ( α , β ) = l ( α ) . By Lemma 1 and the H o ¨ lder inequality, we have the estimate
F ^ ( t ) α B ( Γ β ) i = 1 d C Δ t l ( α ) ( K ˜ 1 K ˜ 2 i ) 1 / 2 ,
with l ( α ) = β + 1 , where
K ˜ 1 = E t n X n sup s 1 [ t n , t n + 1 ] | f α k ( s 1 , X s 1 t n , X n ) | 2 ,
and
K ˜ 2 i = E t n X n sup s 2 [ t n , t n + 1 ] | P ( s 2 ) | 2 .
The inequality (26) in Lemma 3 and the polynomial growth bound on f α give us the estimate
K ˜ 1 C ( 1 + | X n | 2 r ) .
From the definition of the P K z ( s ) , we also have K ˜ 2 i C .
Combining the above estimates, we obtain
F ^ ( t ) C ( 1 + | X n | 2 r ) ( Δ t ) β + 1 .
Step 2. The case 2 l 2 ( β + 1 ) . We take the deterministic Taylor expansion of the function F p at the point X n + 1 X n to obtain
F ^ ( t ) r = 1 l 1 r ! k 1 = 1 q k r = 1 q F ^ k 1 , , k r ( t ) ,
where
F ^ k 1 , , k r ( t ) = | E t n X n [ ( X t n + 1 t n , X n , k 1 X n + 1 , k 1 ) × × ( X t n + 1 t n , X n , k r X n + 1 , k r ) × r x k 1 x k r F p ( X n + 1 X n ) × Δ W ˜ t n + 1 ] | .
(1) First we estimate F ^ k 1 , , k r for r = 1 , that is, F ^ k for k = 1 , , q . From the definition of F p there exists a p P l 1 and a q { 1 , 2 , , l } , such that
x k F p ( X n + 1 X n ) = q F p ( X n + 1 X n ) .
By (30), (33), and the definition of R X n in (25), we deduce
F ^ k ( t ) = | E t n X n α B ( Γ β ) I α [ f α k ( · , X · t n , X n ) ] t n , t n + 1 × q j = 0 d t n t n + 1 σ ^ p j ( · ) d W s j × i = 1 d I ( i ) [ P ( · ) ] t n , t n + 1 | α B ( Γ β ) j = 0 d i = 1 d q | E t n X n I α [ f α k ( · , X · t n , X n ) ] t n , t n + 1 × I ( j ) [ σ ^ p ( · ) ] t n , t n + 1 × I ( i ) [ P ( · ) ] t n , t n + 1 | α B ( Γ β ) j = 0 d i = 1 d q E t n X n | I α [ f α k ( · , X · t n , X n ) ] t n , t n + 1 | 2 1 2 × E t n X n | I ( j ) [ σ ^ p ( · ) ] t n , t n + 1 | 4 1 4 × E t n X n | I ( i ) [ P ( · ) ] t n , t n + 1 | 4 1 4 .
For α B ( Γ β ) , using Lemma 1 and the polynomial growth bound on f α , we have the, estimate,
E t n X n | I α [ f α k ( · , X · t n , X n ) ] t n , t n + 1 | 2 1 2 C sup t n s t n + 1 E t n X n | f α k ( s , X s t n , X n ) | 2 ( Δ t ) β + 1 C ( 1 + | X n | 2 r ) ( Δ t ) β + 1 .
Then, using Lemma 2, we have
E t n X n | I ( i ) [ σ ^ p ( · ) ] t n , t n + 1 | 4 1 4 C E t n X n sup t n s t n + 1 | σ ^ p ( s ) | 4 1 4 ( Δ t ) 1 2 ,
and
E t n X n | I ( i ) [ P ( · ) ] t n , t n + 1 | 4 1 4 C E t n X n sup t n s t n + 1 | P ( s ) | 4 1 4 ( Δ t ) 1 2 .
Combining the estimates (32)–(37), we deduce
F ^ ( t ) C ( 1 + | X n | 2 r ) ( Δ t ) β + 2 .
(2) Now we estimate F ^ k 1 , , k r ( t ) for 2 r l . For each ( k 1 , , k r ) P r , there is a finite q { 1 , 2 , } and p P l r such that
r x k 1 x k r F p ( X n + 1 X n ) = q F p ( X n + 1 X n ) .
Thus, using the upper equality and H o ¨ lder inequality to (33), we obtain
F ^ k 1 , , k r ( t ) = | E t n X n [ ( X t n + 1 t n , X n , k 1 X n + 1 , k 1 ) ( X t n + 1 t n , X n , k r X n + 1 , k r ) × r x k 1 x k r F p ( X n + 1 X n ) × Δ W ˜ t n + 1 ] | q ( E t n X n | F p ( X n + 1 X n ) | 2 E t n X n [ | i = 1 d I ( i ) [ P ( · ) ] t n , t n + 1 | 2 | X t n + 1 t n , X n , k 1 X n + 1 , k 1 | 2 | X t n + 1 t n , X n , k r X n + 1 , k r | 2 ] ) 1 2 q d i = 1 d E t n X n | F p ( X n + 1 X n ) | 2 1 2 E t n X n | I ( i ) [ P ( · ) ] t n , t n + 1 | 4 1 4 E t n X n | X t n + 1 t n , X n , k 1 X n + 1 , k 1 | 8 1 8 E t n X n | X t n + 1 t n , X n , k r X n + 1 , k r | 2 r + 2 1 / 2 r + 2 .
By Lemma 3, the polynomial growth bound on f α and (26), for each k = 1 , , q and l = 4 , , 2 r + 1 , we deduce
E t n X n | X t n + 1 t n , X n , k X n + 1 , k | 2 l 1 / 2 l = E t n X n | α B ( Γ β ) I α [ f α k ( · , X · t n , X n ) ] t n , t n + 1 | 2 l 1 / 2 l α B ( Γ β ) E t n X n | I α [ f α k ( · , X · t n , X n ) ] t n , t n + 1 | 2 l 1 / 2 l α B ( Γ β ) C Δ t l ( α ) / 2 E t n X n sup t n s t n + 1 | f α k ( s , X s t n , X n ) | 2 l 1 / 2 l α B ( Γ β ) C Δ t ( β + 1 ) / 2 1 + E t n X n sup t n s t n + 1 | X s t n , X n | 2 l 1 2 l C ( 1 + | X n | 2 r ) ( Δ t ) ( β + 1 ) / 2 .
Then by Lemma 5, (37), (39), and (40), we obtain
F ^ k 1 , , k r ( t ) C ( 1 + | X n | 2 r ) ( Δ t ) ( l r ) / 2 ( Δ t ) ( β + 1 ) / 2 ( Δ t ) ( β + 1 ) / 2 ( Δ t ) 1 / 2 C ( 1 + | X n | 2 r ) ( Δ t ) β + 3 2 .
Hence, from (32) and (41), we have the estimate
F ^ ( t ) C ( 1 + | X n | 2 r ) ( Δ t ) β + 3 2 .
At last, by (31), (38), and (42), we complete the proof. □
Proposition 1.
Under the conditions of Lemma 3, for the sufficiently small time-step Δ t satisfying (3), there exist constants C ( 0 , ) and r { 1 , 2 , } such that
| E t n X n g ( X t n + 1 t n , X n ) g ( X n + 1 ) Δ W ˜ t n + 1 | C ( 1 + | X n | 2 r ) ( Δ t ) β + 1 ,
where Δ W ˜ t n + 1 ( 0 n N 1 )can be defined by (5) with s = t n + 1 .
Proof. 
For the function g C P 2 ( β + 1 ) , we use the deterministic Taylor expansion to obtain
| E t n X n g ( X t n + 1 t n , X n ) g ( X n + 1 ) Δ W ˜ t n + 1 | = | E t n X n g ( X t n + 1 t n , X n ) g ( X t n ) g ( X n + 1 ) g ( X n ) Δ W ˜ t n + 1 | = | E t n X n [ ( l = 1 2 β + 1 1 l ! p P l [ y p g ( X t n ) ] F p ( X t n + 1 t n , X n X t n ) + R 0 ( X t n + 1 t n , X n ) l = 1 2 β + 1 1 l ! p P l [ y p g ( X t n ) ] F p ( X n + 1 X n ) R 0 ( X n + 1 ) ) Δ W ˜ t n + 1 ] | ,
for 0 n N 1 . Here, the remainder terms are in the form of
R 0 ( Z ) = 1 ( 2 ( β + 1 ) ) ! p P 2 ( β + 1 ) [ y p g ( X n + Θ p ( Z ) ( Z X n ) ) ] × F p ( Z X n ) ,
for Z = X t n + 1 t n , X n and X n + 1 , respectively, where Θ p ( Z ) is a q × q diagonal matrix with diagonal components
Θ p k , k ( Z ) = Θ ^ p k ( Z ) [ 0 , 1 ] ,
for k = 1 , 2 , , q .
Now, by (43), we obtain
| E t n X n g ( X t n + 1 t n , X n ) g ( X n + 1 ) Δ W ˜ t n + 1 | l = 1 2 β + 1 1 l ! p P l | y p g ( X t n ) | × | E t n X n F p ( X t n + 1 t n , X n X t n ) F p ( X n + 1 X n ) Δ W ˜ t n + 1 | + | E t n X n R 0 ( X t n + 1 t n , X n ) Δ W ˜ t n + 1 | + | E t n X n R 0 ( X n + 1 ) Δ W ˜ t n + 1 | .
Then, by using (44), (45), and applying Lemma 5, and the polynomial growth bound on the derivatives of g, we obtain
E t n X n [ | R 0 ( X t n + 1 t n , X n ) Δ W ˜ t n + 1 | ] C ( 1 + | X n | 2 r ) ( Δ t ) β + 1 .
Applying Lemma 6 and combing (46) with (47), we complete the proof. □
Lemma 7.
Under the conditions of Lemma 3, then for the sufficiently small time-step Δ t n satisfying (3), we have that for any 0 n N 1 ,
E [ | R z 1 n | 2 ] C ( 1 + E [ | X 0 | 4 r ] ) ( Δ t ) 2 β + 2 , E [ | R z 2 n | 2 ] C ( 1 + E [ | X 0 | 4 r ] ) ( Δ t ) 2 β + 2 .
Proof. 
We know that
R z 1 n = E t n X n [ ( Y t n + 1 t n , X n Y ˜ t n + 1 t n , X n ) Δ W ˜ t n + 1 * ] , R z 2 n = E t n X n [ ( f t n + 1 t n , X n f ˜ t n + 1 t n , X n ) Δ W ˜ t n + 1 * ] .
Applying Proposition 1, we complete the proof.  □

3.3. Error Estimates

In order to give the error estimates, we also need the convergence order of the truncated error terms R y n and R z n in (12) and (16) for solving Y t and Z t in the BSDE in (2) by the discretizations (17) and (18) in Scheme 1. In the following lemma, we give the convergence order for R y n and R z n .
Lemma 8.
If f ( t , x , y , z ) C b 2 , 4 , 4 , 4 , b ( t , x ) , σ ( t , x ) C b 2 , 4 , φ C b 4 + α , α ( 0 , 1 ) and | b ( t , x ) | 2 K ( 1 + | x | 2 ) , | σ ( t , x ) | 2 K ( 1 + | x | 2 ) , then for the sufficiently small time-step Δ t n satisfying (3), we have that for any 0 n N 1 ,
E [ | R y n | 2 ] C ( 1 + E [ | X n | 8 ] ) ( Δ t ) 6 , E [ | R z n | 2 ] C ( 1 + E [ | X n | 8 ] ) ( Δ t ) 6 ,
where C is a positive constant depending only on T, K, and upper bounds of the derivatives of b, σ, f and φ.
For the proof, the reader is referred to Lemmas 4.2 and 4.5 in [16].
Theorem 2.
Assume the conditions of Lemma 3 hold and the initial values satisfy E [ | e y N | 2 ] = O ( ( Δ t ) 2 ) and E [ | e z N | 2 ] = O ( ( Δ t ) 2 ) . If f ( t , x , y , z ) C b 2 , 4 , 4 , 4 , b ( t , x ) , σ ( t , x ) C b 2 , 4 , φ C b 4 + α , α ( 0 , 1 ) and | b ( t , x ) | 2 K ( 1 + | x | 2 ) , | σ ( t , x ) | 2 K ( 1 + | x | 2 ) . Then for the sufficiently small time-step Δ t n satisfying (3), we have that for any 0 n N 1 ,
E [ | e y n | 2 ] + Δ t i = n N 1 E [ | e z i | 2 ] C ( Δ t 2 β + Δ t 4 ) ,
where C is also a positive constant depending on c 0 , T, L, K, the initial value of ( X t ) t [ 0 , T ] in (1), and the upper bounds of the derivatives of b, σ, f, and φ.
Proof. 
According to Lemmas 4, 7, and 8, we get
i = n N 1 1 + C Δ t 1 C Δ t i n C E [ | R y 1 i | 2 + ( Δ t ) 2 | R y 2 i | 2 + | R y i | 2 ] Δ t ( 1 C Δ t ) C ( 1 + E [ | X 0 | 4 r ] + E [ | X 0 | 8 ] ) ( ( Δ t ) 2 β + ( Δ t ) 4 ) ,
and
i = n N 1 1 + C Δ t 1 C Δ t i n C Δ t E [ ( 1 Δ t n ) 2 | R z 1 i | 2 + | R z 2 i | 2 + ( 1 Δ t n ) 2 | R z i | 2 ] ( 1 C Δ t ) C ( 1 + E [ | X 0 | 4 r ] + E [ | X 0 | 8 ] ) ( ( Δ t ) 2 β + ( Δ t ) 4 ) .
Now by Theorem 1, and the estimates (50) and (51), we complete the proof.  □
Scheme 2.
Let K = max { K y , K z , K f } . Given random variables X 0 , Y N i and Z N i , i = 0 , 1 , , K 1 . Let { X n } n = 0 N be the numerical solution of the forward SDE in the decoupled FBSDEs by a numerical method for solving the SDE. For n = N K , , 0 ,
  • solve Z n by
    Z n = 1 Δ t n E t n X n [ Y n + 1 Δ W ˜ n , 1 * ] + i = 1 K f b K f , i n E t n X n [ f n + i Δ W ˜ n , i * ] ,
  • solve Y n by
    Y n = E t n X n [ Y n + 1 ] + Δ t n i = 0 K y b K y , i n E t n X n [ f n + i ] .
Regarding the proposed Scheme 2, the reader is referred to Scheme 1 in [17].
Theorem 3.
Under the conditions of Lemma 3, furthermore, suppose the initial values satisfy max N K + 1 i N E [ | e y i | 2 ] = O ( ( Δ t ) K y + 1 ) and max N K + 1 i N E [ | e z i | 2 ] = O ( ( Δ t ) K f + 1 K z + ( Δ t ) K z + 1 ) .
Let K = max ( K y , K z , K f ) ; if the order-β weak Taylor Scheme is used to solve the SDE (1) in Scheme 2, then for 0 n N -K, we have the following error estimate:
E [ | e y n | 2 ] + Δ t i = n N K E [ | e z i | 2 ] C [ ( Δ t ) 2 β + ( Δ t ) 2 K y + 2 + ( Δ t ) 2 K f + 2 2 K z + ( Δ t ) 2 K z + 2 ] ,
where C is a constant depending on c 0 , T, L, K, the initial value of ( X t ) t [ 0 , T ] in (1), and the upper bounds of the derivatives of b, σ, f, and φ.
Since the proof of the theorem essentially uses the argument developed in the proof of Theorem 2, we omit it.
Now we introduce some classical numerical schemes in the form of (2.2) that can be used in Scheme 1 for solving the forward SDE.
Example 1.
The Euler scheme is given by
X n + 1 = X n + b ( t n , X n ) Δ t n + σ ( t n , X n ) Δ W t n + 1 .
We know the Euler scheme with β = 1 , so we can obtain the error estimate as
E [ | e y n | 2 ] + Δ t i = n N 1 E [ | e Z i | 2 ] C ( Δ t ) 2 .
Example 2.
The order-2.0 weak Taylor scheme is given by
X n + 1 = X n + b ( t n , X n ) Δ t n + σ ( t n , X n ) Δ W t n + 1 + L 0 b ( t n , X n ) t n t n + 1 t n s 1 d r d s + L 1 b ( t n , X n ) t n t n + 1 t n s 1 d W r d s + L 0 σ ( t n , X n ) t n t n + 1 t n s 1 d r d W s + L 1 σ ( t n , X n ) t n t n + 1 t n s 1 d W r d W s .
We know the order-2.0 weak Taylor scheme with β = 2 , so we can obtain the error estimate as
E [ | e y n | 2 ] + Δ t i = n N 1 E [ | e Z i | 2 ] C ( Δ t ) 4 .

4. Conclusions

We first investigated the weak convergence analysis about the error terms which are determined by the discretization for solving the forward equation in FBSDEs, and we showed that the solution of BSDE ( Y , Z ) admits a higher-order convergence rate. In most present studies, error estimates can be obtained with an analytic solution of the forward equation in FBSDEs, whereas we could not exactly solve the forward equation in many cases. Therefore, it is very important to study the weak convergence of the numerical solution of the associated discretization schemes. Recently, there has been a lot of research about the numerical schemes and error estimates of FBSDEs with jumps [19,20,21,22], corresponding to a rigorous weak convergence analysis of numerical schemes for general FBSDEs where jumps are a focus for ongoing work.

Author Contributions

W.Z. is mainly responsible for providing methods, and H.M. is mainly responsible for scientific research. All authors have read and agreed to the published version of the manuscript.

Funding

The work is supported by the National Natural Science Foundation of China (No. 12001023).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Antonelli, F. Backwardforward stochastic differential equations. Ann. Appl. Probab. 1993, 3, 777–793. [Google Scholar] [CrossRef]
  2. Karoui, N.; Peng, S.; Quenez, M. Backward stochastic differential equations in finance. Math. Financ. 1997, 7, 1–71. [Google Scholar] [CrossRef]
  3. Ma, J.; Yong, J. Forward-Backward Stochastic Differential Equations and Their Applications; Lecture Notes in Math.; Springer: Berlin/Heidelberg, Germany, 1999. [Google Scholar]
  4. Pardoux, E.; Peng, S. Adapted solution of a backward stochastic differntial equation. Syst. Control Lett. 1990, 14, 55–61. [Google Scholar] [CrossRef]
  5. Peng, S. Backward SDE and related g-expectation, in backward stochastic differential equations (Paris, 1995–1996). In Pitman Research Notes in Mathematics Series; Longman: Harlow, UK, 1997; Volume 364, pp. 141–159. [Google Scholar]
  6. Bender, C.; Denk, R. A forward scheme for backward SDEs. Stoch. Process. Their Appl. 2007, 117, 1793–1812. [Google Scholar] [CrossRef] [Green Version]
  7. Bouchard, B.; Touzi, N. Discrete-time approximation and Monte-Carlo simulation of backward stochastic differential equations. Stoch. Process. Their Appl. 2004, 111, 175–206. [Google Scholar] [CrossRef] [Green Version]
  8. Gobet, E.; Labart, C. Error expansion for the discretization of backward stochastic differential equations. Stoch. Process. Their Appl. 2007, 117, 803–829. [Google Scholar] [CrossRef] [Green Version]
  9. Milstein, G.; Tretyakov, M. Numerical algorithms for forward-backward stochastic differential equations. SIAM J. Sci. Comput. 2006, 28, 561–582. [Google Scholar] [CrossRef]
  10. Zhang, J. A numerical scheme for BSDEs. Ann. Appl. Probab. 2004, 14, 459–488. [Google Scholar] [CrossRef]
  11. Chassagneux, J.; Crisen, D. Runge-Kutta schemes for backward stochastic differential equations. Ann. Appl. Probab. 2014, 24, 679–720. [Google Scholar] [CrossRef] [Green Version]
  12. Zhao, W.; Chen, L.; Peng, S. A new kind of accurate numerical method for backward stochastic differential equations. SIAM J. Sci. Comput. 2006, 28, 1563–1581. [Google Scholar] [CrossRef]
  13. Zhao, W.; Fu, Y.; Zhou, T. New kinds of high-order multistep schemes for coupled forward backward stochastic differential equations. SIAM J. Sci. Comput. 2014, 36, A1731–A1751. [Google Scholar] [CrossRef]
  14. Zhao, W.; Wang, J.; Peng, S. Error estimates of the θ-scheme for backward stochastic differential equations. Dis. Con. Dyn. Sys. B 2009, 12, 905–924. [Google Scholar] [CrossRef]
  15. Zhao, W.; Zhang, G.; Ju, L. A stable multistep scheme for solving backward stochastic differential equations. SIAM J. Numer. Anal. 2010, 48, 1369–1394. [Google Scholar] [CrossRef]
  16. Zhao, W.; Zhang, W.; Ju, L. A numerical method and its error estimates for the decoupled forward-backward stochastic differential equations. Commun. Comput. Phys. 2014, 15, 618–646. [Google Scholar] [CrossRef]
  17. Zhao, W.; Zhang, W.; Ju, L. A multistep scheme for decoupled forward backward stochastic differential equations. Numer. Math. Theory Methods Appl. 2016, 9, 262–288. [Google Scholar] [CrossRef]
  18. Kloeden, P.; Platen, E. Numerical Solution of Stochastic Differential Equations; Third Printing; Springer: Berlin, Germany, 1999. [Google Scholar]
  19. Bouchard, B.; Elie, R. Discrete-time approximation of decoupled forward-backward SDE with jumps. Stoch. Process. Their Appl. 2008, 118, 53–75. [Google Scholar] [CrossRef] [Green Version]
  20. Fu, Y.; Yang, J.; Zhao, W. Prediction-correction scheme for decoupled forward backward stochastic differential equations with jumps. East Asian J. Appl. Math. 2016, 6, 253–277. [Google Scholar] [CrossRef]
  21. Fu, Y.; Zhao, W.; Zhou, T. Multistep schemes for forward backward stochastic differential equations with jumps. J. Sci. Comput. 2016, 69, 651–672. [Google Scholar] [CrossRef]
  22. Zhao, W.; Zhang, W.; Zhang, G. Second order numerical schemes for decoupled forward backward stochastic differential equations with jumps. Int. J. Comput. Math. 2017, 35, 213–244. [Google Scholar] [CrossRef] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Zhang, W.; Min, H. Weak Convergence Analysis and Improved Error Estimates for Decoupled Forward-Backward Stochastic Differential Equations. Mathematics 2021, 9, 848. https://0-doi-org.brum.beds.ac.uk/10.3390/math9080848

AMA Style

Zhang W, Min H. Weak Convergence Analysis and Improved Error Estimates for Decoupled Forward-Backward Stochastic Differential Equations. Mathematics. 2021; 9(8):848. https://0-doi-org.brum.beds.ac.uk/10.3390/math9080848

Chicago/Turabian Style

Zhang, Wei, and Hui Min. 2021. "Weak Convergence Analysis and Improved Error Estimates for Decoupled Forward-Backward Stochastic Differential Equations" Mathematics 9, no. 8: 848. https://0-doi-org.brum.beds.ac.uk/10.3390/math9080848

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop