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 :
where , with being the deterministic terminal time; is a complete, filtered probability space with filtration being the natural filtration of the standard d-dimensional Brownian motion ; is the initial condition for the forward stochastic differential equation (FSDE); is the terminal condition for the backward stochastic differential equation (BSDE); the coefficients b: and : , the generator f: , and are unknown.
We point out that , , and are all -adapted for any fixed numbers and z, and that the two stochastic integrals with respect to are of the Itô type. A triple is called an -adapted solution of the decoupled FBSDEs (1) and (2) if, in the probability space , it is -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 , , and .
- : the -field generated by the diffusion process starting from the time-space point . When , we use to denote .
- : the conditional expectation of the random variable X under the -field , that is, . Let .
- : the set of polynomials of degree i defined on .
- : the set of continuously differential functions with uniformly bounded partial derivatives for .
- : the set of functions with uniformly bounded partial derivatives for and .
- : the set of continuously differential functions with uniformly bounded partial derivatives and for and .
- : the set of k times continuously differentiable functions for which and all of its partial derivatives of orders up to and including k have polynomial growth.
2. Discretization
For the time interval , we introduce the following partitions:
Let and . We also assume that the time partitions have the following regularity:
where is a constant.
Let be the solution of (1) and (2) with date ; that is, satisfies
2.1. Reference Equations
To derive the reference equations, we first define the stochastic process
The process is a martingale with the properties , for , and
Then when , we have and .
Fixed , let and be the solution of (4) with for . Denote by , . Then it is easy to get that
for . 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
where represents the convergence rate in the strong or weak sense and 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 and from the BSDE (7).
Since is a martingale for , by taking the conditional expectation on (7) we get
Then, multiplying Equation (7) by and taking the conditional mathematical expectation on both sides of the derived equation, we obtain
Under the filtration the integrands in (9) and (10) are deterministic functions of , so some numerical integration methods for deterministic integration can be used to approximate these integrals.
First, we apply the trapezoidal rule to obtain
with the truncation error
2.2. Numerical Scheme
Now we propose a new numerical scheme for solving the decoupled FBSDEs (4). Let denote an approximation to the analytic solution of (4) at time , . To simplify the presentation, we let for . Based on (13) and (16), we propose a numerical scheme, for solving the FBSDEs (4) as follows.
Scheme 1.
3. Error Estimates
We now provide some theoretical analysis on the numerical stability and convergence of the Scheme 1. Let us denote by and the approximate values of and at the time-space , respectively, where is the approximate solution of calculated by (8), that is, and . To simplify the presentation, we first introduce the following notation:
and , for , and
for .
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 , and , , be the exact solution of the decoupled FBSDEs (1) and (2) and the approximate solution obtained by Scheme 1, respectively. Assume that the function is Lipschitz-continuous with respect to x, y, and z, and the Lipschitz constant is L. Let be the time partitions regularity parameter defined in (3). Then, for the sufficiently small time-step satisfying (3), it holds that
for , where C is a positive constant depending on and L; is also a positive constant depending on , T and L; and and 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 and , if and , then for , we have
Remark 2.
The terms and in (12) and (16) come from the approximations in their reference equations for and . The four terms , and 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 , 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 , , , , , and under certain regularity conditions on b, , f and . For the sake of presentation simplicity, we only consider the case , and the results obtained also hold true for general positive integers q and d. In order to get the estimates of and , 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 ,
- Let be the length of the multi-index , where for , . Here, d is the number of components of the Wiener process W under consideration. For example: .
- Let be the number of components of a multi-index which are equal to 0. For example: .
- For completeness, denote by the multi-index of length zero, that is, with .
- If , write and for the multi-index in obtained by deleting the first and last component, respectively, of . Thus, .
- Define to be the multi-index obtained from by deleting all of the components equal to 0. For , if , then we have .
- Denote by 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 , for , the number of components of between the ith nonzero component and the th nonzero component or the end of if . For example: we have and , , .
- Define .
- Let and be two stopping times with , w.p.1. Then, for a multi-index , and a process the multi Itô integral is recursively defined byFor with the set is recursively defined to be the totality of adapted right continuous processes with left-hand limits such that the integral process considered as a function of t satisfies . For ,where set
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.
The next lemma provides an estimate for the higher moments of a multiple Itô integral.
Lemma 2.
Let , and . Then for we have the estimate
where .
Next, we consider the coefficients of stochastic Itô-Taylor expansions. First, we write the definition of diffusion operator as
and for the operator as
For each and function with we define recursively as
In order to give weak Taylor expansion schemes, we use the following definitions:
- Call a subset an hierarchical set if it satisfies:(1) is nonempty: ;(2) The multi-indices in are uniformly bounded in length: ;(3) for each .
- For any given hierarchical set define the remainder set of by .
In the general multi-dimensional case , for , define the weak Taylor scheme of order by the vector equation
with and
for , where . Here, is assumed. The scheme (24) is obtained from
Here, , is an hierarchical set, and is the remainder set of .
We denote by the space of l times continuously differentiable functions for which g and all its derivatives of orders up to and including l have polynomial growth.
Lemma 3.
Let be given and suppose that the coefficients belong to the space and belong to the space and satisfy Lipschitz conditions and linear growth bounds for and . Then, for each and for the sufficiently small time-step satisfying (3), there exist constants and such that
and
Lemma 4.
Under the conditions that Lemma 3 holds, then for the sufficiently small time-step satisfying (3), we have that for any ,
Proof.
We know that
Using Lemma 3, we can get the results directly. □
In order to give the estimates of and , we need the following lemmas. Due to the complexity of the Itô Taylor expansion, we give some useful notations.
We write and
for all and ,
Then starting from (24) and (29), by a generalization of the Itô formula to semi-martingales, we obtain
for all and , , where
for and
Lemma 5.
Under the conditions of Lemma 3 for each and the sufficiently small time-step satisfying (3), there exist constants and such that
for all and where .
To give an important proposition, first we need to prove the following lemma.
Lemma 6.
Under the conditions of Lemma 3, there exist constants and such that
for all , .
Proof.
Step 1. The case . In this case, with . Then by (23) and (29), we have
where are the set of backward orthogonal polynomials on from the definition of in (5).
By Lemma 1, only the terms with in the sum on the right-hand side of the above inequality are not zero. For , it is easy to check . By Lemma 1 and the Hlder inequality, we have the estimate
with , where
and
The inequality (26) in Lemma 3 and the polynomial growth bound on give us the estimate
From the definition of the , we also have .
Combining the above estimates, we obtain
Step 2. The case . We take the deterministic Taylor expansion of the function at the point to obtain
where
(1) First we estimate for , that is, for . From the definition of there exists a and a , such that
For , using Lemma 1 and the polynomial growth bound on , we have the, estimate,
Then, using Lemma 2, we have
and
Combining the estimates (32)–(37), we deduce
(2) Now we estimate for . For each , there is a finite and such that
Thus, using the upper equality and Hlder inequality to (33), we obtain
By Lemma 3, the polynomial growth bound on and (26), for each and , we deduce
Proposition 1.
Proof.
For the function , we use the deterministic Taylor expansion to obtain
for . Here, the remainder terms are in the form of
for and , respectively, where is a diagonal matrix with diagonal components
for .
Now, by (43), we obtain
Lemma 7.
Under the conditions of Lemma 3, then for the sufficiently small time-step satisfying (3), we have that for any ,
Proof.
We know that
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 and in (12) and (16) for solving and in the BSDE in (2) by the discretizations (17) and (18) in Scheme 1. In the following lemma, we give the convergence order for and .
Lemma 8.
If , , and , , then for the sufficiently small time-step satisfying (3), we have that for any ,
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 and . If , , and , . Then for the sufficiently small time-step satisfying (3), we have that for any ,
where C is also a positive constant depending on , T, L, K, the initial value of in (1), and the upper bounds of the derivatives of b, σ, f, and φ.
Proof.
According to Lemmas 4, 7, and 8, we get
and
Scheme 2.
Let . Given random variables , and , . Let be the numerical solution of the forward SDE in the decoupled FBSDEs by a numerical method for solving the SDE. For ,
- solve by
- solve by
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 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
We know the Euler scheme with , so we can obtain the error estimate as
Example 2.
The order-2.0 weak Taylor scheme is given by
We know the order-2.0 weak Taylor scheme with , so we can obtain the error estimate as
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 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
- Antonelli, F. Backwardforward stochastic differential equations. Ann. Appl. Probab. 1993, 3, 777–793. [Google Scholar] [CrossRef]
- Karoui, N.; Peng, S.; Quenez, M. Backward stochastic differential equations in finance. Math. Financ. 1997, 7, 1–71. [Google Scholar] [CrossRef]
- Ma, J.; Yong, J. Forward-Backward Stochastic Differential Equations and Their Applications; Lecture Notes in Math.; Springer: Berlin/Heidelberg, Germany, 1999. [Google Scholar]
- Pardoux, E.; Peng, S. Adapted solution of a backward stochastic differntial equation. Syst. Control Lett. 1990, 14, 55–61. [Google Scholar] [CrossRef]
- 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]
- Bender, C.; Denk, R. A forward scheme for backward SDEs. Stoch. Process. Their Appl. 2007, 117, 1793–1812. [Google Scholar] [CrossRef]
- 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]
- 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]
- Milstein, G.; Tretyakov, M. Numerical algorithms for forward-backward stochastic differential equations. SIAM J. Sci. Comput. 2006, 28, 561–582. [Google Scholar] [CrossRef]
- Zhang, J. A numerical scheme for BSDEs. Ann. Appl. Probab. 2004, 14, 459–488. [Google Scholar] [CrossRef]
- Chassagneux, J.; Crisen, D. Runge-Kutta schemes for backward stochastic differential equations. Ann. Appl. Probab. 2014, 24, 679–720. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Kloeden, P.; Platen, E. Numerical Solution of Stochastic Differential Equations; Third Printing; Springer: Berlin, Germany, 1999. [Google Scholar]
- 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]
- 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]
- 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]
- 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]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).