On the speed of convergence of Picard iterations
of backward stochastic differential equations
Abstract
It is a well-established fact in the scientific literature that Picard iterations of backward stochastic differential equations with globally Lipschitz continuous nonlinearity converge at least exponentially fast to the solution. In this paper we prove that this convergence is in fact at least square-root factorially fast. We show for one example that no higher convergence speed is possible in general. Moreover, if the nonlinearity is -independent, then the convergence is even factorially fast. Thus we reveal a phase transition in the speed of convergence of Picard iterations of backward stochastic differential equations.
1 Introduction
Since their introduction by Pardoux & Peng in [17] backward stochastic differential equations (BSDEs) have been extensively studied in the scientific literature and have found numerous applications. For example, BSDEs provide a solution approach for stochastic optimal control problems, BSDEs appear in the pricing and hedging of options in mathematical finance, and BSDEs provide stochastic representations of semilinear parabolic partial differential equations (PDEs).
A standard approach for proving existence results for BSDEs is to construct a contraction mapping whose fixed point is the solution of the BSDE. The associated fixed point iterations, the so-called Picard iterations, are a key component of several numerical approximation methods for BSDEs. We refer, e.g., to [2, 3] for numerical approximation methods for BSDEs based on Picard iterations and the least squares Monte Carlo method, we refer, e.g., to [10, 15] for numerical approximation methods for BSDEs based on Picard iterations and adaptive control variates, we refer, e.g., to [4, 9] for numerical approximation methods for BSDEs based on Picard iterations and Wiener chaos expansions, and we refer, e.g., to [6, 13, 7, 14, 11, 1, 12] for numerical approximation methods for BSDEs based on Picard iterations and a multilevel technique. Precise estimates on the speed of convergence of the Picard iterations to the solution of the BSDE are essential for the error analyses of these numerical approximation methods for BSDEs where and .
Picard iterations, e.g., of ordinary differential equations converge not only exponentially fast but even factorially fast under suitable assumptions. Picard iterations of BSDEs are known to converge at least square-root factorially fast if the nonlinearity is z-independent; see the proof of [17, Theorem 3.1]. In the general case of z-dependent nonlinearities we have only found results proving that Picard iterations converge at least exponentially fast (see, e.g., [8, Theorem 2.1], [21, Theorem 4.3.1], and [19, Theorem 6.2.1]).
In this article we prove for BSDEs with z-independent and globally Lipschitz continuous nonlinearities that the Picard iterations converge in fact factorially fast. Moreover, we show for BSDEs with z-dependent and globally Lipschitz continuous nonlinearities that the Picard iterations converge at least square-root factorially fast. Somewhat surprisingly this speed of convergence cannot be improved in general. More precisely, we establish for a linear example BSDE a corresponding lower bound. We thereby reveal a phase transition in the speed of convergence of Picard iterations between the z-independent and the z-dependent case. Theorem 1.1 below illustrates the main results of this article.
Theorem 1.1.
Let , , , , let satisfy for all that is the standard norm on , let denote the Frobenius norm on , let be a filtered probability space which satisfies the usual conditions111Let and let be a filtered probability space. Then we say that satisfies the usual conditions if and only if it holds for all that ., let be measurable, assume for all , , it holds a.s. that
(1) |
let be a standard -Brownian motion with continuous sample paths, let be -measurable, let , , be adapted with continuous sample paths, let , , be progressively measurable, assume that for all , it holds a.s. that , , , and
(2) |
and let , , satisfy for all that
(3) |
Then
-
(i)
there exists such that for all it holds that
-
(ii)
if, in addition to the above assumptions, it holds that , then there exists such that for all it holds that and
-
(iii)
if, in addition to the above assumptions, , , and for all , , it holds a.s. that , then there exists such that for all it holds that
Item (i) of Theorem 1.1 is a direct consequence of Proposition 4.1 and Remark 4.2. Item (ii) of Theorem 1.1 follows from Proposition 4.1 and Remark 4.3. Item (i) of Theorem 1.1 and Corollary 2.2 prove Item (iii) of Theorem 1.1. The proof of Item (i) of Theorem 1.1 is based on Lemma 3.1 which shows for all , , that
(4) |
based on the Lipschitz continuity of , iterating (4) times and then setting to get an upper bound of the form for .
We finally discuss some possible consequences of Item (iii) of Theorem 1.1 on the performance of numerical approximation methods for BSDEs based on Picard iterations in high-dimensional situations. To this end we consider a sequence of BSDEs indexed by the dimension of the driving Brownian motion whose associated Lipschitz constants , , grow for some like as . Item (iii) of Theorem 1.1 shows that it is possible in such a situation that the approximation errors , , grow faster in the dimension than any polynomial in the sense that for all there exists such that for all it holds that .
The remainder of this article is organized as follows. In Section 2 we provide lower bounds for the convergence speed of Picard iterations. In Section 2.2 we establish in Corollary 2.2 lower bounds for the convergence speed of Picard iterations for a linear example BSDE. In our proof of Corollary 2.2 we employ lower bounds for the convergence speed of Picard iterations for a linear example PDE which we prove in Lemma 2.1 in Section 2.1. In Lemma 3.1 in Section 3 we establish explicit a priori estimates for certain backward Itô processes in appropriate -norms. In Section 4 we provide upper bounds for the convergence speed of Picard iterations of BSDEs. Proposition 4.1 establishes an explicit bound for the -distance between the Picard iterations and the solution of a BSDE with a globally Lipschitz continuous nonlinearity. In Remark 4.2 we employ the estimate of Proposition 4.1 to obtain the square root-factorial speed of convergence of Picard iterations. In Remark 4.3 we employ the estimate of Proposition 4.1 to obtain the factorial speed of convergence of Picard iterations in the z-independent case.
2 Lower bounds for the convergence speed of Picard iterations
In this section we provide lower bounds for the convergence speed of Picard iterations of BSDEs. In Lemma 2.1 in Section 2.1 we establish lower bounds for the convergence speed of Picard iterations for a linear example PDE. We employ Lemma 2.1 in our proof of Corollary 2.2 in Section 2.2 to provide lower bounds for the convergence speed of Picard iterations for a linear example BSDE. Corollary 2.2 shows that square-root factorial convergence speed cannot be improved up to exponential factors in the case of -dependent drivers. Item (ii) of Theorem 1.1 shows in the case of -independent drivers that factorial speed of convergence is possible. Lemma 2.3 observes that factorial speed of convergence cannot be improved up to exponential factors in the case of -dependent drivers.
2.1 Lower bounds for the convergence speed of Picard iterations for an example PDE
Lemma 2.1.
Let , , let denote the standard scalar product on , let denote the standard norm on , let be a probability space, let be a standard Brownian motion, let , , satisfy for all , , that ,
(5) |
and
(6) |
Then
-
(i)
it holds for all , that , , and
(7) -
(ii)
it holds for all , , that , ,
(8) and
(9) -
(iii)
it holds for all that
(10) -
(iv)
it holds that
(11) and
-
(v)
it holds for all , that
(12)
Proof of Lemma 2.1.
Next observe that (5) proves for all , , , that , , and
(13) |
This, the disintegration theorem, and independence of Brownian increments show for all , , , , that
(14) |
This, the fact that , and (5) show for all , , that
(15) |
This, the fact that , and (5) show for all , , that
(16) |
Next note that Stein’s lemma proves for all , , , , with that
(17) |
This, (16), differentiation under integrals, the fact that , and the fact that show for all , , , that
(18) |
For the next step let , let , , satisfy for all , that
(19) |
and for every let satisfy that . A well-known fact on Hermite polynomials shows for all , that Furthermore, a well-known fact on moments of normally distributed random variables shows for all , that and
(20) |
This, (19), and the binomial theorem imply for all that
(21) |
and
(22) |
Thus, it holds for all that
(23) |
Furthermore, the combinatorial interpretation of multinomial coefficients yields for all , with that
(24) |
This, the fact that are independent, (5), and the fact that show for all that
(25) |
This, (23), and the multinomial theorem show for all that
(26) |
This establishes (iii).
2.2 Lower bounds for the convergence speed of Picard iterations for an example BSDE
Corollary 2.2.
Let , , let denote the standard scalar product on , let denote the standard norm on , let be a filtered probability space which satisfies the usual conditions, let be a standard -Brownian motion with continuous sample paths, let , , be adapted with continuous sample paths, let , , be progressively measurable, and assume for all , that a.s. it holds that , , and
(32) |
Then for all it holds a.s. that .
Proof of Corollary 2.2.
Throughout this proof let , , satisfy for all , , that ,
(33) |
and
(34) |
Then Lemma 2.1 proves
-
a)
for all , that and
(35) -
b)
for all , , that and
(36) and
-
c)
for all that
(37)
This and Itô’s formula prove that for all it holds a.s. that
(38) |
This, (32), and a standard result on uniqueness of backward stochastic differential equations (cf., e.g., [21, Theorem 4.3.1]) prove for all that and .
Next, we prove by induction on that for all , it holds that and . First, the fact that and the fact that establish the base case . For the induction step let satisfy for all that and . This, (36), the Markov property of , the fact that for all it holds a.s. that , (32), and adaptedness of imply that for all it holds a.s. that
(39) |
This, Itô’s formula, the fact that , (34), and (32) show that for all it holds a.s. that
(40) |
This and the uniqueness of the decomposition of continuous semimartingales show for all that and . This completes the induction step. Induction thus shows for all , that and . This and the fact that imply that for all it holds a.s. that . This, the fact that for all with it holds that
(41) |
the fact that for all with it holds that
(42) |
and (37) imply that for all it holds a.s. that
(43) |
This completes the proof of Corollary 2.2. ∎
The following Lemma 2.3 gives an example where the BSDE solution is an expoential function (see Item (i)) and the Picard approximations are just partial sums of the exponential series (see Item (ii)). Thereby, Lemma 2.3 shows that factorial speed of convergence cannot be improved up to exponential factors in the case of -dependent drivers.
Lemma 2.3.
Let and let , , satisfy for all , that , , and . Then
-
i)
it holds for all that ,
-
ii)
it holds for all , that , and
-
iii)
it holds that .
Proof of Lemma 2.3.
The fact that and the substitution rule show for all that . This, the fact that , and the Picard–Lindelöf theorem show (i). Next, we prove (ii) by induction on . The fact that shows the base case . For the induction step let and assume for all that . The assumptions of Lemma 2.3 then show for all that
(44) |
This completes the induction step. Induction hence shows (ii). Combining (i), (ii), and the fact that yields (iii). The proof of Lemma 2.3 is thus completed. ∎
3 A priori estimates for backward Itô processes
In this section we establish a priori estimates for certain backward Itô processes. Results of this form are well-known in the scientific literature on BSDEs (see, e.g., [17, Proof of Theorem 3.1], [8, Proposition 2.1], [21, Theorem 4.2.1], [18, Proposition 5.2]). Lemma 3.1 below establishes estimates for an Itô process and its diffusion process in terms of the drift process and in terms of the terminal value of the Itô process. The contribution of Lemma 3.1 is to provide explicit universal constants. Moreover, the Itô process in Lemma 3.1 and its drift process are not assumed to be square-integrable and, in particular, the right-hand sides of (46), (47), and (LABEL:eq:b03) are allowed to be infinite (with positive probability). We note that square-integrability of the diffusion process in Lemma 3.1, however, is in general required; e.g., choose and such that the Itô isometry does not hold for the Itô integral .
Lemma 3.1.
Let , , let denote the standard scalar product on , let denote the standard norm on , let denote the Frobenius norm on , let be a filtered probability space which satisfies the usual conditions, let be a standard -Brownian motion with continuous sample paths, let be adapted with continuous sample paths, let be measurable, let be progressively measurable, and assume that for all it holds a.s. that
(45) |
Then
-
(i)
for all , it holds a.s. that
(46) -
(ii)
for all , it holds a.s. that
(47) and
-
(iii)
it holds for all that
(48)
Proof of Lemma 3.1.
Throughout this proof for every let satisfy that a.s. on it holds that and a.s. on it holds that , let be an orthonormal basis of , and let . First note that (45), Jensen’s inequality, and the Burkholder-Davis-Gundy inequality (see, e.g., [5, Lemma 7.2]) yield that for all it holds a.s. on that
(49) |
This, the -Burkholder-Davis-Gundy inequality (e.g., [20, Theorem 1]), the Cauchy-Schwarz inequality, and Hölder’s inequality imply that for all it holds a.s. on that
(50) |
This, (45), and (49) yield that for all it holds a.s. that is a martingale with respect to and
(51) |
Next note that (45) and Itô’s formula show that for all it holds a.s. that
(52) |
This shows that for all it holds a.s. that
(53) |
This and (51) show that for all it holds a.s. on that
(54) |
This and the definition of , , prove (i).
4 Upper bounds for the convergence speed of Picard iterations
In this section we provide upper bounds for the convergence speed of Picard iterations of BSDEs. Proposition 4.1 establishes an explicit bound for the -distance between the Picard iterations and the solution of a BSDE with a globally Lipschitz continuous nonlinearity. Our proof of Proposition 4.1 relies on the a priori estimates for backward Itô processes provided in Lemma 3.1. In Remark 4.2 we employ the estimate of Proposition 4.1 to obtain the square root-factorial speed of convergence of Picard iterations. In Remark 4.3 we employ the estimate of Proposition 4.1 to obtain the factorial speed of convergence of Picard iterations in the z-independent case.
Proposition 4.1.
Let , , , let , let denote the standard scalar product on , let denote the standard norm on , let denote the Frobenius norm on , let be a filtered probability space which satisfies the usual conditions, let be measurable, assume that for all , , it holds a.s. that
(59) |
let be a standard -Brownian motion with continuous sample paths, let be -measurable, let , , be adapted with continuous sample paths, let , , be progressively measurable, and assume that for all , it holds a.s. that , , , and
(60) |
Then it holds for all that
(61) |
Proof of Proposition 4.1.
First note that (60) proves that for all , it holds a.s. that
(62) |
This, the tower property, Tonelli’s theorem, and Lemma 3.1 (applied for every with , , in the notation of Lemma 3.1) prove
-
(i)
that for all , it holds that
(63) and
-
(ii)
that for all , it holds that
(64)
This, (59), and the fact that show for all , that
(65) |
This and induction prove for all , that
(66) |
This and (65) show for all , that
(67) |
This and (63) prove for all , that
(68) |
Furthermore, observe for all that
(69) |
This and (68) yield for all that
(70) |
Next note that (59) ensures that
(71) | |||
This, the fact that , and (70) complete the proof of Proposition 4.1. ∎
Remark 4.2.
Assume the setting of Proposition 4.1. Then it holds for all that
(72) |
Remark 4.3.
Assume the setting of Proposition 4.1 and assume that . Then it holds for all that
(73) |
Acknowledgements
This work has been funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the research grant HU1889/7-1.
References
- [1] Beck, C., Hornung, F., Hutzenthaler, M., Jentzen, A., and Kruse, T. Overcoming the curse of dimensionality in the numerical approximation of Allen–Cahn partial differential equations via truncated full-history recursive multilevel Picard approximations. Journal of Numerical Mathematics 28, 4 (2020), 197–222.
- [2] Bender, C., and Denk, R. A forward scheme for backward SDEs. Stochastic Process. Appl. 117, 12 (2007), 1793–1812.
- [3] Bender, C., and Zhang, J. Time discretization and Markovian iteration for coupled FBSDEs. The Annals of Applied Probability 18, 1 (2008), 143–177.
- [4] Briand, P., and Labart, C. Simulation of BSDEs by Wiener chaos expansion. Ann. Appl. Probab. 24, 3 (2014), 1129–1171.
- [5] Da Prato, G., and Zabczyk, J. Stochastic equations in infinite dimensions, vol. 44 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 1992.
- [6] E, W., Hutzenthaler, M., Jentzen, A., and Kruse, T. Multilevel Picard iterations for solving smooth semilinear parabolic heat equations. arXiv:1607.03295 (2016). Accepted in Partial Differential Equations and Applications.
- [7] E, W., Hutzenthaler, M., Jentzen, A., and Kruse, T. On multilevel Picard numerical approximations for high-dimensional nonlinear parabolic partial differential equations and high-dimensional nonlinear backward stochastic differential equations. Journal of Scientific Computing 79, 3 (2019), 1534–1571.
- [8] El Karoui, N., Peng, S., and Quenez, M. C. Backward stochastic differential equations in finance. Math. Finance 7, 1 (1997), 1–71.
- [9] Geiss, C., and Labart, C. Simulation of BSDEs with jumps by Wiener chaos expansion. Stochastic Process. Appl. 126, 7 (2016), 2123–2162.
- [10] Gobet, E., and Labart, C. Solving BSDE with adaptive control variate. SIAM J. Numer. Anal. 48, 1 (2010), 257–277.
- [11] Hutzenthaler, M., Jentzen, A., and Kruse, T. Overcoming the curse of dimensionality in the numerical approximation of parabolic partial differential equations with gradient-dependent nonlinearities. arXiv:1912.02571 (2019). Accepted in Foundations of Computational Mathematics.
- [12] Hutzenthaler, M., Jentzen, A., Kruse, T., and Nguyen, T. A. Multilevel Picard approximations for high-dimensional semilinear second-order PDEs with Lipschitz nonlinearities. arXiv:2009.02484 (2020).
- [13] Hutzenthaler, M., Jentzen, A., Kruse, T., Nguyen, T. A., and von Wurstemberger, P. Overcoming the curse of dimensionality in the numerical approximation of semilinear parabolic partial differential equations. Proceedings of the Royal Society A 476, 2244 (2020), 20190630.
- [14] Hutzenthaler, M., and Kruse, T. Multilevel Picard approximations of high-dimensional semilinear parabolic differential equations with gradient-dependent nonlinearities. SIAM Journal on Numerical Analysis 58, 2 (2020), 929–961.
- [15] Labart, C., and Lelong, J. A parallel algorithm for solving BSDEs. Monte Carlo Methods Appl. 19, 1 (2013), 11–39.
- [16] Øksendal, B. Stochastic differential equations. Universitext. Springer-Verlag, Berlin, 1985. An introduction with applications.
- [17] Pardoux, É., and Peng, S. Adapted solution of a backward stochastic differential equation. Systems Control Lett. 14, 1 (1990), 55–61.
- [18] Pardoux, E., and Răşcanu, A. Stochastic differential equations, Backward SDEs, Partial differential equations. Springer, 2016.
- [19] Pham, H. Continuous-time stochastic control and optimization with financial applications, vol. 61. Springer Science & Business Media, 2009.
- [20] Ren, Y.-F. On the Burkholder–Davis–Gundy inequalities for continuous martingales. Statistics & probability letters 78, 17 (2008), 3034–3039.
- [21] Zhang, J. Backward Stochastic Differential Equations. From Linear to Fully Nonlinear Theory. Springer, 2017.