Abstract
We introduce a new family of numerical algorithms for approximating solutions of general high-dimensional semilinear parabolic partial differential equations at single space-time points. The algorithm is obtained through a delicate combination of the Feynman–Kac and the Bismut–Elworthy–Li formulas, and an approximate decomposition of the Picard fixed-point iteration with multilevel accuracy. The algorithm has been tested on a variety of semilinear partial differential equations that arise in physics and finance, with satisfactory results. Analytical tools needed for the analysis of such algorithms, including a semilinear Feynman–Kac formula, a new class of seminorms and their recursive inequalities, are also introduced. They allow us to prove for semilinear heat equations with gradient-independent nonlinearities that the computational complexity of the proposed algorithm is bounded by \(O(d\,{\varepsilon }^{-(4+\delta )})\) for any \(\delta \in (0,\infty )\) under suitable assumptions, where \(d\in {{\mathbb {N}}}\) is the dimensionality of the problem and \({\varepsilon }\in (0,\infty )\) is the prescribed accuracy. Moreover, the introduced class of numerical algorithms is also powerful for proving high-dimensional approximation capacities for deep neural networks.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction and main results
High-dimensional partial differential equations (PDEs) arise naturally in many important areas including quantum mechanics, statistical physics, financial engineering, economics, etc. Yet developing efficient and practical algorithms for these high-dimensional PDEs has been a long-standing problem and indeed one of the most challenging tasks in mathematics. The difficulty lies in the “curse of dimensionality” [5], i.e., the complexity of the problem goes up exponentially as a function of dimension, which is a well-known obstacle that is also at the heart of many other important subjects such as high-dimensional statistics and the modeling of many-body systems.
For linear parabolic PDEs, the Feynman–Kac formula establishes an explicit representation of the solution of the PDE as the expectation of the solution of an appropriate stochastic differential equation (SDE). Monte Carlo methods together with suitable discretizations of the SDE (see, e.g., [30, 31, 38, 39]) then allow to approximate the solution at any single point in space-time with a computational complexity that grows as \(O(d{\varepsilon }^{-(2+\delta )})\) for any \(\delta \in (0,\infty )\) where d is the dimensionality of the problem and \({\varepsilon }\) is the accuracy required (cf., e.g., [20, 23, 25, 26]).
In the seminal papers [40,41,42], Pardoux & Peng established a generalized nonlinear Feynman–Kac formula that gives an explicit representation of the solution of a semilinear parabolic PDE through the solution of an appropriate backward stochastic differential equation (BSDE). Solving BSDEs numerically, however, requires in general suitable discretizations of nested conditional expectations (see, e.g., [8, 47]) and the straightforward Monte Carlo method applied to these nested conditional expectations results in an algorithm with a computational complexity that grows polynomially in d but at least exponentially in \({\varepsilon }^{-1}\). Other discretization methods for the nested conditional expectations proposed in the literature include the quantization tree method (see [3]), the regression method based on Malliavin calculus or based on kernel estimation (see [8]), the projection on function spaces method (see [22]), the cubature on Wiener space method (see [13]), and the Wiener chaos decomposition method (see [9]). None of these algorithms meets the requirement that the computational complexity has been proven to grow at most polynomially both in d and \({\varepsilon }^{-1}\) (see [17, Sects. 6.1–6.6] for a detailed discussion of these approximation methods).
Another probabilistic representation for the solutions of some semilinear parabolic PDEs with polynomial nonlinearity has been established in Skorohod [45] by means of branching diffusion processes. Recently this classical representation has been extended to more general analytic nonlinearities [27,28,29]. This probabilistic representation has been successfully used to obtain a Monte Carlo approximation method for semilinear parabolic PDEs with a computational complexity that grows polynomially both in d and \({\varepsilon }^{-1}\). However, this method is only applicable to PDEs with analytic nonlinearities and it requires the terminal/initial condition to be suitably small (see [17, Sect. 6.7] for a detailed discussion).
In this paper we propose a new family of numerical algorithms for approximating solutions of general high-dimensional semilinear parabolic PDEs (and BSDEs) at single space-time points; see (12) below for the definition of our approximations. For semilinear heat equations with gradient-independent nonlinearities we prove that the computational complexity (see Corollary 3.19 below for the precise meaning hereof) of our proposed algorithm is \(O(d\,{\varepsilon }^{-(4+\delta )})\) for any \(\delta \in (0,\infty )\). For this we assume that the PDE solution \(u:[0,T]\times {{\mathbb {R}}}^d \rightarrow {{\mathbb {R}}}\) is infinitely often differentiable and that the nonlinearity and the rescaled derivatives \( (k!)^{-\frac{3}{4}}\big (\frac{\partial }{\partial t}+\frac{1}{2}\Delta _{x}\big )^ku \) are uniformly bounded in time, space, \(k\in {{\mathbb {N}}}_0\), and in the dimension; see Corollary 3.19 below for details. In Sect. 3.8 we provide an example which satisfies these assumptions. These strong smoothness assumptions are used in the error analysis in this article.
After a first preprint of this work has appeared, a series of further research articles inspired by this work have appeared; see, e.g., [4, 17, 32,33,34,35]. In particular, the paper [35] analyzes the algorithm (12) in the case of gradient-dependent nonlinearities under stronger smoothness assumptions than those of Corollary 3.19. Moreover, the paper [33] relaxes the smoothness assumptions of Corollary 3.19 and proves for general Lipschitz continuous, gradient-independent nonlinearities that a variant of the algorithm (12) with quadrature rules being replaced by Monte Carlo averages is efficient in high dimensions. Furthermore, in [32] this variant of the algorithm (12) is used to prove that deep neural networks overcome the curse of dimensionality in the numerical approximation of solutions of semilinear heat equations with gradient-independent nonlinearities.
The algorithm (12), which we will call “multilevel Picard iteration”, is a delicate combination of the Feynman–Kac and Bismut–Elworthy–Li formulas, and a decomposition of the Picard iteration with multilevels of accuracy. The efficiency and accuracy of the proposed algorithm has been tested on a variety of semilinear parabolic PDEs that arise in physics and finance. These details are presented in [17]. To get a feeling about the performance of the algorithm: To approximate u(1, 0) for the solution \(u:[0,1]\times {{\mathbb {R}}}^d \rightarrow {{\mathbb {R}}}\) of
with \(d=100, {\varepsilon }=0.01, u( 0, x) =( 1 + \max \{ | x_1 |^2, \ldots , | x_{100} |^2\})^{-1} \) requires 10 s of runtime on a 2.8 GHz Intel i7 processor with 16 GB RAM.
We also introduce the tools needed to analyze these high-dimensional algorithms. Some of these tools are quite non-standard (e.g. the seminorms (19) and the recursive inequality (53) involving different seminorms). Using these tools, we are able to rigorously prove the bounds for the computational complexity mentioned above.
1.1 Notation
Since the proposed algorithm relies heavily on the Feynman–Kac formula, we will adopt the notations and conventions in stochastic analysis. In addition, we frequently use the following notation. We denote by \( \left\| \cdot \right\| :\left( \cup _{ n \in \mathbb {N}}\mathbb {R}^{n}\right) \rightarrow [0,\infty ) \) and by \( \langle \cdot , \cdot \rangle :\left( \cup _{ n \in \mathbb {N}} \mathbb {R}^{n} \times \mathbb {R}^{n} \right) \rightarrow [0,\infty ) \) the functions which satisfy for all \( n \in {{{\mathbb {N}}}}\), \( v = ( v_1, \dots , v_n ) \), \( w = ( w_1, \dots , w_n ) \in {{{\mathbb {R}}}}^n \) that \( \left\| v \right\| = \big [ \sum _{i=1}^n\left| v_i \right| ^2 \big ]^{ 1 / 2 } \) and \( \langle v, w \rangle = \sum _{i=1}^n v_i w_i \). For every topological space \((E,{\mathcal {E}})\) we denote by \({\mathcal {B}}(E)\) the Borel-sigma-algebra on \((E,{\mathcal {E}})\). For all measurable spaces \((A,{\mathcal {A}})\) and \((B,{\mathcal {B}})\) we denote by \({\mathcal {M}}({\mathcal {A}},{\mathcal {B}})\) the set of \({\mathcal {A}}\)/\({\mathcal {B}}\)-measurable functions from A to B. For all metric spaces \((E,d_E)\) and \((F,d_F)\) we denote by \({{\text {Lip}}}(E,F)\) the set of all globally Lipschitz continuous functions from E to F. For every \(d\in {{{\mathbb {N}}}}\) we denote by \({{{\mathbb {R}}}}^{d\times d}_{ {\text {Inv}} }\) the set of invertible matrices in \({{{\mathbb {R}}}}^{d\times d}\). For every \(d\in {{{\mathbb {N}}}}\) and every \(A\in {{{\mathbb {R}}}}^{d\times d}\) we denote by \(A^{*}\in {{{\mathbb {R}}}}^{d\times d}\) the transpose of A. For every \(d\in {{\mathbb {N}}}\) and every \(x=(x_1,\ldots ,x_d)\in {{{\mathbb {R}}}}^d\) we denote by \({\text {diag}}(x)\in {{{\mathbb {R}}}}^{d\times d}\) the diagonal matrix with diagonal entries \(x_1,\ldots ,x_d\). For every \(T\in (0,\infty )\) we denote by \({\mathcal {Q}}_T\) the set given by \({\mathcal {Q}}_T=\{w:[0,T]\rightarrow {{{\mathbb {R}}}}:w^{-1}({{{\mathbb {R}}}}\backslash \{0\})\text { is a finite set}\}\). We denote by \(\lfloor \cdot \rfloor :{{{\mathbb {R}}}}\rightarrow {{{\mathbb {Z}}}}\) and \([\cdot ]^{+}:{{{\mathbb {R}}}}\rightarrow [0,\infty )\) the functions that satisfy for all \(x\in {{{\mathbb {R}}}}\) that \(\lfloor x\rfloor =\max ({{{\mathbb {Z}}}}\cap (-\infty ,x])\) and \([x]^+=\max \{x,0\}\). We use the conventions \(0\cdot \infty =0\) and \(0^0=1\).
2 Multilevel Picard iteration for semilinear parabolic PDEs
2.1 A fixed-point equation for semilinear PDEs
Let \( T \in (0,\infty )\), \( d \in {{{\mathbb {N}}}}\), let \( g :{ {{\mathbb {R}}}}^d \rightarrow {{{\mathbb {R}}}}\), \( f :[0,T]\times {{{\mathbb {R}}}}^d\times {{{\mathbb {R}}}} \times {{{\mathbb {R}}}}^{d} \rightarrow {{{\mathbb {R}}}}\), \( u :[0,T] \times {{{\mathbb {R}}}}^d \rightarrow {{{\mathbb {R}}}} \), \( \mu :[0,T] \times {{{\mathbb {R}}}}^d \rightarrow {{{\mathbb {R}}}}^d \), and \( \sigma = ( \sigma _1,\ldots ,\sigma _d ) :[0,T] \times {{{\mathbb {R}}}}^d \rightarrow {{\mathbb {R}}}^{ d \times d }_{ {\text {Inv}} } \) be sufficiently regular functions, assume for all \( t \in [0,T) \), \( x \in {{{\mathbb {R}}}}^d \) that \( u(T,x) = g(x) \) and
let \( ( \Omega , {\mathcal {F}}, {{\mathbb {P}}}, ( {\mathbb {F}}_t )_{ t \in [0,T] } ) \) be a stochastic basis (cf., e.g., [43, Appendix E]), let \( W = ( W^{ 1 }, \dots , \) \( W^{ d } ) :[0,T] \times \Omega \rightarrow {{{\mathbb {R}}}}^d \) be a standard \( ( {\mathbb {F}}_t )_{ t \in [0,T] } \)-Brownian motion, and for every \( s \in [0,T] \), \( x \in {{{\mathbb {R}}}}^d \) let \( X^{ s, x } :[s,T] \times \Omega \rightarrow {{{\mathbb {R}}}}^d \) and \( D^{ s, x } :[s,T] \times \Omega \rightarrow {{{\mathbb {R}}}}^{ d \times d } \) be \( ( {\mathbb {F}}_t )_{ t \in [s,T] } \)-adapted stochastic processes with continuous sample paths which satisfy that for all \( t \in [s,T] \) it holds \( {{{\mathbb {P}}}} \)-a.s. that
(cf., e.g., [36, Chapter 5], [24], or [2] for existence and uniqueness results for stochastic differential equations of the form (3)). For every \(s\in [0,T]\) the processes \( D^{ s, x } \), \(x\in {{{\mathbb {R}}}}^d\), are in a suitable sense the derivative processes of \( X^{ s, x } \), \(x\in {{{\mathbb {R}}}}^d\), with respect to \( x \in {{{\mathbb {R}}}}^d \). Using the Feynman–Kac formula (cf., e.g., [36, Theorem 5.7.6]), we have from (2) for all \((s, x) \in [0,T]\times {{{\mathbb {R}}}^d}\) that
In (4) the derivative of u appears on the right-hand side and, therefore, (4) does not provide a closed fixed point equation. To obtain such a closed fixed point equation we now bring the Bismut-Elworthy-Li formula into play (see, e.g., Elworthy & Li [18, Theorem 2.1] or Da Prato & Zabczyk [14, Theorem 2.1]). This gives us for all \((s, x) \in [0,T)\times {{{\mathbb {R}}}}^d\)
Now let \( \mathbf{u}^{ \infty } \in {{\text {Lip}}}( [0,T) \times {{{\mathbb {R}}}}^d, {{{\mathbb {R}}}}^{ 1 + d } ) \) be defined by \( \mathbf{u}^{ \infty }( s, x ) = \big ( u(s,x), [\sigma (s,x)]^{*}(\nabla _x u )( s, x ) \big ) \) for all \( (s,x) \in [0,T) \times {{{\mathbb {R}}}}^d \). Let \( {\varvec{\Phi }} :{{\text {Lip}}}( [0,T) \times {{{\mathbb {R}}}}^d, {{{\mathbb {R}}}}^{ 1 + d } ) \rightarrow {{\text {Lip}}}( [0,T) \times {{{\mathbb {R}}}}^d, {{{\mathbb {R}}}}^{ 1 + d } ) \) be defined by
for all \( \mathbf{v} \in {{\text {Lip}}}( [0,T) \times {{{\mathbb {R}}}}^d, {{{\mathbb {R}}}}^{ 1 + d } ) \), \( (s,x) \in [0,T) \times {{{\mathbb {R}}}}^d \). Combining (6) with (4) and (5) gives
Next we define a sequence of Picard iterations \((\mathbf{u}_k)_{k\in {{{\mathbb {N}}}}_0}\subseteq {{\text {Lip}}}( [0,T) \times {{{\mathbb {R}}}}^d, {{{\mathbb {R}}}}^{ 1 + d } )\) associated to (6),
for all \( k \in {{{\mathbb {N}}}} \), \(s\in [0,T)\), \(x\in {{{\mathbb {R}}}}^d\). This sequence of Picard iterations has already been studied in the literature; see, e.g., [46, Thereom 7.3.4] or [6]. Under suitable assumptions, e.g., [46, Thereom 7.3.4] ensures that for all \(s\in [0,T)\), \(x\in {{{\mathbb {R}}}}^d\) it holds that \( \lim _{ k \rightarrow \infty } \mathbf{u}_k(s,x) = \mathbf{u}^{ \infty }(s,x) \). Observe that for all \( k \in {{{\mathbb {N}}}} \), \(s\in [0,T)\), \(x\in {{{\mathbb {R}}}}^d\) it holds that
Next we incorporate a zero expectation term to slightly reduce the variance when approximating the expectation involving g by Monte Carlo approximations. More precisely, for all \( k \in {{{\mathbb {N}}}} \), \(s\in [0,T)\), \(x\in {{{\mathbb {R}}}}^d\) it holds that
In this telescope expansion, we will apply a fundamental idea of Heinrich [25, 26] and Giles [19] (control variates were also used, e.g., in [21, 37]) and approximate the continuous quantities (expectation and time integral) by discrete ones (Monte Carlo averages and quadrature formulas respectively) with different degrees of accuracy at different levels of the Picard iteration. Since for large \(l\in {{\mathbb {N}}}\) the difference between \( \mathbf{u}_{l}\) and \(\mathbf{u}_{l-1}\) is small, say \(\rho ^{-l}\) for some \(\rho \in {{{\mathbb {N}}}}\), it suffices to approximate the expectation and the time integral with lower accuracy, say \(\rho ^{-(k-l)}\), at level \(l\in \{0,\ldots ,k-1\}\) for the k-th approximation to achieve a total error roughly of order \(\rho ^{-k}\). More precisely, we denote by \( ( q^{ k,\rho }_s )_{ k \in {{{\mathbb {N}}}}_0, \rho \in {{{\mathbb {N}}}}, s \in [0,T) } \subseteq {\mathcal {Q}}_T \) a family of quadrature formulas on \(C([0,T],{{{\mathbb {R}}}})\) that we employ to approximate the time integrals \( \int _s^T \dots dt \), \(s\in [0,T]\), appearing on the right-hand side of (10). We denote by \( \Theta = \cup _{ n \in {{{\mathbb {N}}}} } {{{\mathbb {R}}}}^n \) a set that allows to index families of independent random variables which we need for the Monte Carlo approximations. We denote by \( ( {\mathfrak {m}}_{ k, \rho } )_{ k\in {{{\mathbb {N}}}}_0, \rho \in {{{\mathbb {N}}}} }\) and \( ( m_{ k, \rho } )_{ k \in {{{\mathbb {N}}}}_0, \rho \in {{{\mathbb {N}}}} } \subseteq {{{\mathbb {N}}}} \) families of natural numbers that specify the number of Monte Carlo samples for approximating the expectations involving g and f on the right-hand side of (10). In Sect. 3.1 we will take \({\mathfrak {m}}_{k,\rho }=m_{k,\rho }=\rho ^k\) for every \(k\in {{{\mathbb {N}}}}_0\), \(\rho \in {{{\mathbb {N}}}}\) and we take \(q^{k,\rho }\) as the Gauß–Legendre quadrature rule with \( \rho \) nodes. Furthermore, for every \(k\in {{{\mathbb {N}}}}_0\), \(\rho \in {{{\mathbb {N}}}}\), \(\theta \in \Theta \), \((s,x)\in [0,T)\times {{{\mathbb {R}}}}^d\) we denote by \( ( {\mathcal {X}}_{ k, \rho }^{ \theta }( s,x, t ))_{ t \in [s,T] } \) and \( ( {\mathcal {I}}_{ k, \rho }^{\theta }( s,x, t ) )_{ t \in (s,T] } \) the stochastic processes that we employ to approximate the processes \( ( X^{ s, x }_t )_{ t \in [s,T] } \) and \( \big ( 1 , \tfrac{ [\sigma (s,x)]^{*} }{ t - s } \smallint _s^t \big [ \sigma ( r, X_r^{ s, x } )^{ - 1 } D_r^{ s, x } \big ]^{ * } \, d W_r \big ) _{ t \in (s,T] } \). More specifically, we choose for every \(k\in {{{\mathbb {N}}}}_0\), \(\rho \in {{\mathbb {N}}}\), \(\theta \in \Theta \), \((s,x)\in [0,T)\times {{{\mathbb {R}}}}^d\) the processes \( ( {\mathcal {X}}_{ k, \rho }^{ \theta }( s,x, t ))_{ t \in [s,T] } \) and \( ( {\mathcal {I}}_{ k, \rho }^{\theta }( s,x, t ) )_{ t \in (s,T] } \) such that for all \(t\in (s,T]\) we have that
For all these approximations the parameters \(k\in {{{\mathbb {N}}}}_0\), \(\rho \in {{{\mathbb {N}}}}\) specify the degree of discretization in the sense that the approximation errors get smaller in a suitable sense as \(k\in {{{\mathbb {N}}}}_0\), \(\rho \in {{\mathbb {N}}}\) get larger. We note that if we can sample from the distributions of the random variables on the right-hand sides of (11) as, e.g., in the case of Brownian motion, then we do not need to approximate them (see Example 2.1 below).
2.2 The approximation scheme
Let \( T \in (0,\infty ) \), \( d \in {{{\mathbb {N}}}} \), \( \Theta = \cup _{ n \in {{{\mathbb {N}}}} } {{{\mathbb {R}}}}^n \), let \( g :{{{\mathbb {R}}}}^d \rightarrow {{{\mathbb {R}}}} \), \( f :[0,T]\times {{{\mathbb {R}}}}^d \times {{{\mathbb {R}}}} \times {{{\mathbb {R}}}}^{d} \rightarrow {{\mathbb {R}}}\), \( \mu :[0,T] \times {{{\mathbb {R}}}}^d \rightarrow {{{\mathbb {R}}}}^d \), \( \sigma :[0,T] \times {{{\mathbb {R}}}}^d \rightarrow {{{\mathbb {R}}}}^{ d \times d }_{ {\text {Inv}} } \) be measurable functions, let \( ( q^{ k, \rho }_s )_{ k\in {{{\mathbb {N}}}}_0, \rho \in {{{\mathbb {N}}}}, s \in [0,T) } \subseteq {\mathcal {Q}}_T \), \( ( {\mathfrak {m}}_{ k, \rho } )_{ k\in {{{\mathbb {N}}}}_0, \rho \in {{{\mathbb {N}}}} } ,\) \( ( m_{ k, \rho } )_{ k \in {{{\mathbb {N}}}}_0, \rho \in {{{\mathbb {N}}}} } \subseteq {{{\mathbb {N}}}} \), let \( ( \Omega , {\mathcal {F}}, {{{\mathbb {P}}}}, ( {\mathbb {F}}_t )_{ t \in [0,T] } ) \) be a stochastic basis, for every \( l,\rho \in {{{\mathbb {N}}}}\), \( \theta \in \Theta \), \( x \in {{{\mathbb {R}}}}^d \), \( s \in [0,T) \), \( t \in [s,T] \) let \( {\mathcal {X}}_{ l, \rho }^{ \theta }( s,x, t ) :\Omega \rightarrow {{{\mathbb {R}}}}^d \) and \( {\mathcal {I}}_{ l, \rho }^{ \theta }( s,x, t) :\Omega \rightarrow {{{\mathbb {R}}}}^{ 1+d } \) be functions, and for every \( \theta \in \Theta \), \( \rho \in {{{\mathbb {N}}}} \) let \( \mathbf{U}^{ \theta }_{ k, \rho } :[0,T]\times {{{\mathbb {R}}}}^d \times \Omega \rightarrow {{{\mathbb {R}}}}^{ d + 1 } \), \( k \in {{{\mathbb {N}}}}_0 \), be functions that satisfy for all \(k\in {{{\mathbb {N}}}}\), \( (s,x) \in [0,T)\times {{\mathbb {R}}}^d \) that
Observe that the approximation scheme (12) employs Picard fixed-point iteration (cf., e.g., [6]), multilevel/multigrid techniques (see, e.g., [12, 20, 25, 26]), discretizations of the SDE system (3), as well as quadrature approximations for the time integrals. The numerical approximations (12) are full history recursive in the sense that for every \((k,\rho )\in {{{\mathbb {N}}}}\times {{{\mathbb {N}}}}\) the full history \( \mathbf{U}^{ ( \cdot ) }_{ 0, \rho } \), \( \mathbf{U}^{ ( \cdot ) }_{ 1, \rho } \), \( \dots \), \( \mathbf{U}^{ ( \cdot ) }_{ k - 1, \rho } \) needs to be computed recursively in order to compute \( \mathbf{U}^{ ( \cdot ) }_{ k, \rho } \). In this sense the numerical approximations (12) are full history recursive multilevel Picard approximations.
2.3 Special case: semilinear heat equations
In this subsection we specialize the numerical scheme (12) to the case of semilinear heat equations.
Example 2.1
Assume the setting in Sect. 2.2, let \(W^\theta :[0,T]\times \Omega \rightarrow {{{\mathbb {R}}}}^d\), \(\theta \in \Theta \), be independent standard \(({{{\mathcal {F}}}}_t)_{t\in [0,T]}\)-Brownian motions, and assume for all \( k \in {{{\mathbb {N}}}}_0 \), \( \rho \in {{{\mathbb {N}}}} \), \( \theta \in \Theta \), \( x \in {{{\mathbb {R}}}}^d \), \( s \in [0,T) \), \( t \in [s,T] \), \( u \in (s,T] \) that \( {\mathcal {X}}_{ k, \rho }^{ \theta }(s,x,t) = x + W^{ \theta }_t - W^{ \theta }_s \), \( {\mathcal {I}}_{k,\rho }^{\theta }(s,x,s)=0 \), \( {\mathcal {I}}_{k,\rho }^{\theta }(s,x,u)=(1,\tfrac{W_u^{\theta }-W_s^{\theta }}{u-s}) \). Then it holds for all \( \theta \in \Theta \), \( k\in {{{\mathbb {N}}}}\), \(\rho \in {{{\mathbb {N}}}} \), \( (s,x) \in [0,T)\times {{{\mathbb {R}}}}^d \) that
We note that if f does not depend on its last argument, then we only need the first components of the approximations and this simplifies all expressions; cf. (18). We also note that the term g(x) cancels in the first components of the approximations.
2.4 Numerical simulations of high-dimensional semilinear PDEs
We applied the algorithm (12) to approximate the solutions at single space-time points of several semilinear PDEs from physics and financial mathematics such as
-
(i)
a PDE arising from the recursive pricing model with default risk due to Duffie, Schroder, & Skiadas [16],
-
(ii)
a PDE arising from the valuation of derivative contracts with counterparty credit risk (see, e.g., Burgard & Kjaer [10] and Henry-Labordère [27] for derivations of the PDE),
-
(iii)
a PDE arising from pricing models for financial markets with different interest rates for borrowing and lending due to Bergman [7],
-
(iv)
a version of the Allen–Cahn equation with a double well potential, and
-
(v)
a PDE with an explicit solution whose three-dimensional version has been considered in Chassagneux [11].
We took \(d=100\). All simulations are performed on a computer with a 2.8 GHz Intel i7 processor and 16 GB RAM. We refer to [17] for the simulation results, Matlab codes and further details concerning the numerical simulations. These results indicate that the proposed algorithm is efficient and practical for dealing with these high-dimensional PDEs.
3 Convergence rate for the multilevel Picard iteration
In this section we establish the convergence rate for semilinear heat equations in the case where the nonlinearity is independent of the gradient of the solution and satisfies the Lipschitz-type condition (14) below and when the Gauß-Legendre formula (16) (see, e.g., [15] for more details) is used as the quadrature rule. More formally, we consider the special case of (2) where \(\mu \equiv 0\), \(\sigma \equiv \mathbb {1}_{d\times d}\) and f does not depend on its last argument.
3.1 Setting
Let \( T,L \in (0,\infty ) \), \( d \in {{{\mathbb {N}}}} \), \( g \in C^2({{{\mathbb {R}}}}^d,{{{\mathbb {R}}}}) \), \( \Theta = \cup _{ n \in {{{\mathbb {N}}}} } {{{\mathbb {R}}}}^n \), let \( ( \Omega , {\mathcal {F}}, {{{\mathbb {P}}}}, ( {\mathbb {F}}_t )_{ t \in [0,T] } ) \) be a stochastic basis, let \( W^{ \theta } :[0,T] \times \Omega \rightarrow {{{\mathbb {R}}}}^d \), \( \theta \in \Theta \), be independent standard \(({\mathbb {F}}_t)_{t\in [0,T]}\)-Brownian motions with continuous sample paths, let \( f:[0,T]\times {{{\mathbb {R}}}}^d\times {{{\mathbb {R}}}}\rightarrow {{{\mathbb {R}}}} \) be a Borel measurable function which satisfies for all \(t\in [0,T]\), \(x\in {{{\mathbb {R}}}}^d\), \(u_1,u_2\in {{{\mathbb {R}}}}\) that
let \( F:{\mathcal {M}}({\mathcal {B}}([0,T]\times {{{\mathbb {R}}}}^d),{\mathcal {B}}({{{\mathbb {R}}}})) \rightarrow {\mathcal {M}}({\mathcal {B}}([0,T]\times {{{\mathbb {R}}}}^{d}),{\mathcal {B}}({{{\mathbb {R}}}})) \) be the function which satisfies for all \(t\in [0,T]\), \(x\in {{{\mathbb {R}}}}^d\), \(u\in {\mathcal {M}}({\mathcal {B}}([0,T]\times {{{\mathbb {R}}}}^d),{\mathcal {B}}({{\mathbb {R}}}))\) that \( (F(u))(t,x)=f(t,x,u(t,x)) \), let \(u^{\infty }=(u^{\infty }(r,y))_{(r,y)\in [0,T]\times {{{\mathbb {R}}}}^d}\in C^{1,2}([0,T]\times {{{\mathbb {R}}}}^d,{{{\mathbb {R}}}})\) satisfy for all \(r\in [0,T]\), \(y\in {{{\mathbb {R}}}}^d\) that \(u^{\infty }(T,y)=g(y)\) and
for every \(n\in {{{\mathbb {N}}}}\) let \((c_i^{n})_{i\in \{1,\ldots ,n\}}\subseteq [-1,1]\) be the n distinct roots of the Legendre polynomial \([-1,1]\ni x\mapsto \tfrac{1}{2^nn!}\tfrac{d^n}{dx^n}[(x^2-1)^n]\in {{{\mathbb {R}}}}\), for every \(n\in {{{\mathbb {N}}}}\) let the function \(q^{n,[-1,1]}:[-1,1]\rightarrow {{{\mathbb {R}}}}\) satisfy for all \(t\in [-1,1]\) that
for every \(n\in {{{\mathbb {N}}}}\), \(a \in {{{\mathbb {R}}}}\), \(b\in (a,\infty )\) let the function \(q^{n,[a,a]}:[a,a]\rightarrow {{{\mathbb {R}}}}\) satisfy \(q^{n,[a,a]}(a)=0\) and let the function \(q^{n,[a,b]}:[a,b]\rightarrow {{{\mathbb {R}}}}\) satisfy for all \(t\in [a,b]\) that \(q^{n,[a,b]}(t)=\frac{b-a}{2}q^{n,[-1,1]}\bigl (\frac{2t-(a+b)}{b-a}\bigr )\), let \(({\bar{q}}^{n,Q})_{n,Q\in {{{\mathbb {N}}}}_0}\subseteq {\mathcal {Q}}_T\) satisfy for all \(n,Q\in {{{\mathbb {N}}}}\), \(t\in [0,T]\) that \({\bar{q}}^{0,Q}(t)=\mathbb {1}_{\{0\}}(t)\) and
let \({ U}_{ n,M,Q}^{\theta }:[0,T]\times {{{\mathbb {R}}}}^d \times \Omega \rightarrow {{{\mathbb {R}}}}\), \(n,M,Q\in {{{\mathbb {Z}}}}\), \(\theta \in \Theta \), satisfy for all \( n,M,Q \in {{{\mathbb {N}}}} \), \( \theta \in \Theta \), \( (t,x) \in [0,T]\times {{{\mathbb {R}}}}^d \) that \( U_{0,M,Q}^{\theta }(t,x)=0\) and
and for every \(n,Q\in {{{\mathbb {N}}}}_0\) let \(\left\| \cdot \right\| _{n,Q}:\big ({\mathcal {M}}({\mathcal {B}}({{{\mathbb {R}}}}^d)\otimes {\mathcal {F}},{\mathcal {B}}({{{\mathbb {R}}}}))\big )^{[0,T]}\rightarrow [0,\infty ]\) be the function which satisfies for all \(V\in \big ({\mathcal {M}}({\mathcal {B}}({{{\mathbb {R}}}}^d)\otimes {\mathcal {F}},{\mathcal {B}}({{{\mathbb {R}}}}))\big )^{[0,T]}\) that
3.2 Pseudocode
In this subsection a mathematical style pseudocode illustrates that the multilevel Picard approximations (18) can be easily implemented. We assume that the time horizon \(T\in (0,\infty )\), the dimension \(d\in {{{\mathbb {N}}}}\), the terminal condition \(g:{{\mathbb {R}}}^d \rightarrow {{{\mathbb {R}}}}\), the (gradient-independent) nonlinearity \(f:[0,T]\times {{{\mathbb {R}}}}^d \times {{{\mathbb {R}}}} \rightarrow {{{\mathbb {R}}}}\), the basis for the number of Monte Carlo samples \(M\in {{{\mathbb {N}}}}\), the number of quadrature nodes \(Q \in {{{\mathbb {N}}}}\), the increasingly ordered roots \(c\in [-1,1]^Q\) of the Q-th Legendre polynomial, and the corresponding Legendre quadrature weights \(w\in [0,\infty )^Q\) are global variables. For an implementation in Matlab see [17].
![figure a](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs42985-021-00089-5/MediaObjects/42985_2021_89_Figa_HTML.png)
3.3 Sketch of the proof
Throughout this subsection assume the setting in Sect. 3.1 and let \(N,M,Q \in {{{\mathbb {N}}}}\). Theorem 3.12 provides an upper bound for the distance between the approximation \(U^0_{N,M,Q}\) and the PDE solution \(u^\infty \) measured in the seminorm \(\Vert \cdot \Vert _{0,Q}\) given in (19). We establish this bound by splitting the global error \(\Vert U_{N,M,Q}^{0}-u^{\infty }\Vert _{n,Q}\) into the Monte Carlo error \(\Vert U_{N,M,Q}^{0}-{{{\mathbb {E}}}}[U_{N,M,Q}^{0}]\Vert _{n,Q}\) and the time discretization error \(\Vert {{{\mathbb {E}}}}[U_{N,M,Q}^{0}]-u^{\infty }\Vert _{n,Q}\). To analyze the time discretization error, we employ the Feynman–Kac formula to obtain
for all \(s \in [0,T], x\in {{{\mathbb {R}}}}^d\) (see Lemma 3.11 below). Moreover, the approximations admit the following Feynman–Kac-type representation
for all \(s \in [0,T], x\in {{{\mathbb {R}}}}^d\) (see Lemma 3.10 below). This, (20) and the Lipschitz-type assumption (14) show that the time discretization error is bounded from above by the error of the \((N-1)\)-th approximation \(\Vert U_{N-1,M,Q}^{0}- u^{\infty } \Vert _{n+1,Q} \) and the error of the Gauß-Legendre quadrature rule applied to the function \([s,T]\ni t \mapsto {{{\mathbb {E}}}}[F(u^\infty )(t,x+W_{t-s})] \in {{\mathbb {R}}}\) (see (52) below). Combining this with the established bound for the Monte Carlo error (see (50) below) results in the recursive inequality for the global error (53) that can be handled using a discrete Gronwall-type inequality. The error representation for Gauß-Legendre quadrature rules allows to further simplify the global error under suitable regularity assumptions (see Corollary 3.15 below). In Sect. 3.7 we provide upper bounds for the number of realizations of scalar standard normal random variables and for the number of function evaluations of f and g used to compute one realization of \(U^0_{N,M,Q}(t,x)\) for a single point \((t,x)\in [0,T]\times {{\mathbb {R}}}^d\) in space-time. This and Corollary 3.15 prove in the case of the semilinear heat equation (15) that the computational complexity (see Corollary 3.18 for the precise definition hereof) of our proposed scheme grows linearly in the space dimension d and polynomially in the inverse accuracy \({\varepsilon }^{-1}\) if the PDE solution \(u^{\infty }\) is infinitely often differentiable and if the nonlinearity and the rescaled derivatives \(\tfrac{(\frac{\partial }{\partial t}+\frac{1}{2}\Delta _{x})^ku^{\infty }}{(k!)^{1-\alpha }}\) are uniformly bounded in time, space, \(k\in {{{\mathbb {N}}}}_0\), and in the dimension for at least one \(\alpha \in (0,\frac{1}{4}]\); see Corollary 3.18 below for details.
3.4 Preliminary results for the Gauß-Legendre quadrature rules
Lemma 3.1
(Gauß-Legendre over different intervals) Assume the setting in Sect. 3.1, let \(n\in {{{\mathbb {N}}}}\), \(s\in [0,T)\), \(t\in [0,s]\), and let \(\psi :[0,T]\rightarrow [0,\infty ]\) be a non-increasing function. Then we have
Proof
Observe that the fact that \(t\le s\) and the fact that \(\forall \, i \in \{1,\ldots ,n\}:c_i^{n}\in [-1,1]\) ensure that for all \(i\in \{1,\ldots ,n\}\) it holds that \(\tfrac{T-s}{2}c_i^n+\tfrac{T+s}{2}\ge \tfrac{T-t}{2}c_i^n+\tfrac{T+t}{2}\). This and the fact that \(\psi \) is non-increasing imply for all \(i\in \{1,\ldots ,n\}\) that \(\psi (\tfrac{T-s}{2}c_i^n+\tfrac{T+s}{2})\le \psi (\tfrac{T-t}{2}c_i^n+\tfrac{T+t}{2})\). Combining this with (16), the definitions of \(q^{n,[s,T]}\) and \(q^{n,[t,T]}\), and the fact that \(T-s\le T-t\) proves that
This completes the proof of Lemma 3.1. \(\square \)
Lemma 3.2
Assume the setting in Sect. 3.1 and let \(Q\in {{{\mathbb {N}}}}\). Then for all \(n\in {{{\mathbb {N}}}}_0\), \(k\in {{{\mathbb {N}}}}_0\cap [0,2Q-n]\) we have
Proof
First, note that the fact that the Gauß-Legendre quadrature rule \(C([0,T],{{{\mathbb {R}}}})\ni \varphi \mapsto \sum _{t\in [0,T]}q^{Q,[0,T]}(t)\varphi (t)\in {{\mathbb {R}}}\) integrates polynomials of order less than 2Q exactly implies that for all \(s\in [0,T]\), \(k\in {{\mathbb {N}}}_0 \cap [0, 2Q)\) it holds that
We now prove (24) by induction on \(n\in {{\mathbb {N}}}_0\). For the base case \(n=0\) we note that for all \(k\in {{\mathbb {N}}}_0\) it holds that
This establishes (24) in the base case \(n=0\). For the induction step \({{{\mathbb {N}}}}_0 \ni n \rightarrow n+1 \in {{\mathbb {N}}}\) we observe that (25) and the induction hypothesis imply that for all \(k\in {{\mathbb {N}}}_0\cap [0,2Q-n-1]\) it holds that
This finishes the induction step \({{\mathbb {N}}}_0 \ni n \rightarrow n+1 \in {{{\mathbb {N}}}}\). Induction hence establishes (24). The proof of Lemma 3.2 is thus completed. \(\square \)
3.5 Preliminary results for the seminorms
We refer to a \([0,\infty ]\)-valued function as seminorm if it is subadditive and absolutely homogeneous. In particular, we do not require seminorms to have finite values. The proof of the following lemma is clear and therefore omitted.
Lemma 3.3
(Seminorm property) Assume the setting in Sect. 3.1 and let \(k\in {{{\mathbb {N}}}}_0\), \(Q\in {{{\mathbb {N}}}}\). Then the function \(\big ({\mathcal {M}}({\mathcal {B}}({{{\mathbb {R}}}}^d)\otimes {\mathcal {F}},{\mathcal {B}}({{{\mathbb {R}}}}))\big )^{[0,T]} \ni U\mapsto \Vert U\Vert _{k,Q}\in [0,\infty ]\) is a seminorm in the sense that it is subadditive, nonnegative, and absolutely homogeneous.
The following lemma implies that Monte Carlo averages converge in our seminorms with rate 1/2.
Lemma 3.4
(Linear combinations of i.i.d. random variables) Assume the setting in Sect. 3.1, let \(k\in {{{\mathbb {N}}}}_0\), \(n,Q\in {{{\mathbb {N}}}}\), \(r_1,\ldots ,r_n\in {{{\mathbb {R}}}}\), \(V_1,\ldots ,V_n\in ( {\mathcal {M}}({\mathcal {B}}({{{\mathbb {R}}}}^d)\otimes {\mathcal {F}},{\mathcal {B}}({{{\mathbb {R}}}})) )^{[0,T]}\) satisfy for all \( s \in [0,T] \), \( x \in {{{\mathbb {R}}}}^d \) that \(V_1(s,x),\ldots ,V_n(s,x)\) are integrable i.i.d. random variables, and assume for all \(s\in [0,T]\) that \(V_1(s,\cdot ), \ldots , V_n(s,\cdot )\), \(W^0\) are independent. Then
Proof
The definition (19) of the seminorm, the disintegration theorem, the fact that for all \( s \in [0,T] \), \( x \in {{{\mathbb {R}}}}^d \) it holds that \( V_1(s,\cdot ), \ldots , V_n(s,\cdot )\), \(W^0\) are independent, and the fact that for all \( s \in [0,T] \), \( x \in {{{\mathbb {R}}}}^d \) it holds that \( V_1(s,x), \ldots , V_n(s,x)\) are i.i.d. imply that
This completes the proof of Lemma 3.4. \(\square \)
Lemma 3.5
(Lipschitz property) Assume the setting in Sect. 3.1, let \(k\in {{{\mathbb {N}}}}_0\), \(Q\in {{{\mathbb {N}}}}\), and let \(U,V\in \big ({\mathcal {M}}({\mathcal {B}}({{{\mathbb {R}}}}^d)\otimes {\mathcal {F}},{\mathcal {B}}({{{\mathbb {R}}}}))\big )^{[0,T]}\). Then
Proof
The definition (19) of the seminorm and the global Lipschitz property (14) of \(F\) imply that
This completes the proof of Lemma 3.5\(\square \)
Lemma 3.6
Assume the setting in Sect. 3.1, let \(k\in {{{\mathbb {N}}}}_0\), \(Q\in {{{\mathbb {N}}}}\), and let \(U:[0,T] \rightarrow {\mathcal {M}}({\mathcal {B}}({{{\mathbb {R}}}}^d)\otimes {\mathcal {F}},{\mathcal {B}}({{{\mathbb {R}}}}))\) satisfy for all \(s\in [0,T]\) that \(U(s,\cdot )\) and \(W^0\) are independent. Then
Proof
The definition (19) of the seminorm, the triangle inequality, independence, the disintegration theorem, Lemma 3.1, and the definition (17) of \({\bar{q}}^{k+1,Q}\) yield that
This completes the proof of Lemma 3.6. \(\square \)
Lemma 3.7
(Expectation) Assume the setting in Sect. 3.1, let \(k\in {{\mathbb {N}}}_0\), \(Q\in {{{\mathbb {N}}}}\), and let \(U:[0,T] \rightarrow {\mathcal {M}}({\mathcal {B}}({{{\mathbb {R}}}}^d)\otimes {\mathcal {F}},{\mathcal {B}}({{{\mathbb {R}}}}))\) satisfy for all \((s,x)\in [0,T]\times {{{\mathbb {R}}}}^d\) that \({{{\mathbb {E}}}}[|U(s,x)|]<\infty \) and that \(U(s,\cdot )\) and \((W_t^0)_{t\in [0,s]}\) are independent. Then
Proof
The definition (19) of the seminorm, Jensen’s inequality, independence, and the disintegration theorem imply that
This completes the proof of Lemma 3.7. \(\square \)
The following lemma specifies the values of our seminorms of constant functions. It follows directly from the definition (19) of the seminorms and from Lemma 3.2. Its proof is therefore omitted.
Lemma 3.8
(Seminorm of constants) Assume the setting in Sect. 3.1 and let \(Q\in {{{\mathbb {N}}}}\), \(k\in {{{\mathbb {N}}}}_0\cap [0,2Q]\). Then \(\left\| 1\right\| _{k,Q}=\tfrac{T^k}{k!}\).
3.6 Error analysis for the multilevel Picard iteration
Lemma 3.9
(Distributional and independence properties of approximations) Assume the setting in Sect. 3.1. Then
-
(i)
it holds for all \(n\in {{{\mathbb {N}}}}_0\), \(M,Q\in {{{\mathbb {N}}}}\), \(\theta \in \Theta \) that \(U^\theta _{n,M,Q}\in \big ({\mathcal {M}}({\mathcal {B}}({{{\mathbb {R}}}}^d)\otimes {\mathcal {F}},{\mathcal {B}}({{{\mathbb {R}}}}))\big )^{[0,T]}\),
-
(ii)
it holds for all \(n\in {{{\mathbb {N}}}}_0\), \(M,Q\in {{{\mathbb {N}}}}\), \(\theta \in \Theta \), \(t\in [0,T]\) that \(\sigma (U^\theta _{n,M,Q}(t,\cdot ))\subseteq \sigma ((W^{(\theta , \vartheta )})_{\vartheta \in \Theta })\),
-
(iii)
it holds for all \(n\in {{{\mathbb {N}}}}_0\), \(m,M,Q\in {{{\mathbb {N}}}}\), \(\theta \in {{{\mathbb {R}}}}^m\), \(t\in [0,T]\) that \(U^\theta _{n,M,Q}(t,\cdot )\) and \((W^\vartheta )_{\vartheta \in \cup _{k=1}^m{{{\mathbb {R}}}}^k}\) are independent,
-
(iv)
it holds for all \(n\in {{{\mathbb {N}}}}_0\), \(m,M,Q\in {{{\mathbb {N}}}}\), \(t\in [0,T]\), \(\theta ,\vartheta \in {{{\mathbb {R}}}}^m\) with \(\theta \ne \vartheta \) that \(U^\theta _{n,M,Q}(t,\cdot )\) and \(U^\vartheta _{n,M,Q}(t,\cdot )\) are independent, and
-
(v)
it holds for all \(n\in {{{\mathbb {N}}}}_0\), \(M,Q\in {{{\mathbb {N}}}}\), \(t\in [0,T]\), \(x\in {{{\mathbb {R}}}}^d\) that \((U^\theta _{n,M,Q}(t,x))_{\theta \in \Theta }\) are identically distributed.
Proof of Lemma 3.9
First note that the fact that for all \(s,t\in [0,T]\), \(\theta \in \Theta \) it holds that \({{{\mathbb {R}}}}^d\times \Omega \ni (x,\omega )\mapsto x+W_s^{\theta }(\omega )-W_t^\theta (\omega )\in {{{\mathbb {R}}}}^d\) is \(({\mathcal {B}}({{{\mathbb {R}}}}^d)\otimes {\mathcal {F}})/{\mathcal {B}}({{{\mathbb {R}}}}^d)\) measurable, the fact that for all \(s\in [0,T]\) it holds that \({{{\mathbb {R}}}}^d\times {{{\mathbb {R}}}}\ni (x,u)\mapsto f(s,x,u)\in {{{\mathbb {R}}}}\) is \(({\mathcal {B}}({{{\mathbb {R}}}}^d)\otimes {\mathcal {B}}({{{\mathbb {R}}}}))/{\mathcal {B}}({{{\mathbb {R}}}})\) measurable, the fact that \(g\in C^2({{{\mathbb {R}}}}^d,{{{\mathbb {R}}}})\), the fact that for all \(M,Q\in {{{\mathbb {N}}}}\), \(\theta \in \Theta \), \(t\in [0,T]\), \(x\in {{{\mathbb {R}}}}^d\) it holds that \(U^{\theta }_{0,M,Q}(t,x)=0\), and (18) prove item (i) and item (ii). Furthermore, observe that item (ii) and the fact that for all \(m\in {{{\mathbb {N}}}}\), \(\theta \in {{\mathbb {R}}}^m\) it holds that \((W^{(\theta , \vartheta )})_{\vartheta \in \Theta }\) and \((W^\vartheta )_{\vartheta \in \cup _{k=1}^m{{{\mathbb {R}}}}^k}\) are independent establish item (iii). Moreover, note that item (ii) and the fact that for all \(m\in {{{\mathbb {N}}}}\), \(\theta ,\vartheta \in {{{\mathbb {R}}}}^m\) with \(\theta \ne \vartheta \) it holds that \((W^{(\theta ,\gamma )})_{\gamma \in \Theta }\) and \((W^{(\vartheta ,\gamma )})_{\gamma \in \Theta }\) are independent implies item (iv). Finally, observe that the fact that for all \(M,Q\in {{{\mathbb {N}}}}\), \(\theta \in \Theta \), \(t\in [0,T]\), \(x\in {{{\mathbb {R}}}}^d\) it holds that \(U^{\theta }_{0,M,Q}(t,x)=0\), the fact that \((W^\theta )_{\theta \in \Theta }\) are identically distributed, and items (i)–(iv) establish item (v). The proof of Lemma 3.9 is thus completed. \(\square \)
Lemma 3.10
(Approximations are integrable) Assume the setting in Subsection 3.1, let \(z\in {{{\mathbb {R}}}}^d\), \(M,Q\in {{{\mathbb {N}}}}\), and assume for all \(s\in [0,T]\), \(t\in [s,T]\) that \({{{\mathbb {E}}}}\big [|g(z+W_t^0)|+|(F(0))(t,z+W_s^0)|\big ]<\infty \). Then
-
(i)
for all \(n\in {{{\mathbb {N}}}}_0\), \(\theta \in \Theta \), \(s\in [0,T]\), \(t\in [s,T]\) it holds that
$$\begin{aligned} {{\mathbb {E}}}\Big [\big |U_{n,M,Q}^{\theta }(t,z+W_s^0)\big | +\big | \big (F( U_{n,M,Q}^{\theta })\big )(t,z+W_{s}^0) \big | \Big ]<\infty \end{aligned}$$(36)and
-
(ii)
for all \(n\in {{{\mathbb {N}}}}_0\), \(\theta \in \Theta \), \(s\in [0,T]\) it holds that
$$\begin{aligned} \begin{aligned} {{{\mathbb {E}}}}\left[ U_{n+1,M,Q}^{\theta }(s,z) \right] = {{{\mathbb {E}}}}\!\left[ g(z+W_{T-s}^0)+\sum _{t\in [s,T]}q^{Q,[s,T]}(t) \big (F( U_{n,M,Q}^{\theta })\big )(t,z+W_{t-s}^0) \right] . \end{aligned}\nonumber \\ \end{aligned}$$(37)
Proof
We prove item (i) by induction on \(n\in {{{\mathbb {N}}}}_0\). For the base case \(n=0\) we note that for all \(\theta \in \Theta \), \(s\in [0,T]\), \(t\in [s,T]\) it holds that
This establishes item (i) in the base case \(n=0\). For the induction step \({{{\mathbb {N}}}}_0 \ni n \rightarrow n+1 \in {{{\mathbb {N}}}}\) let \(n\in {{{\mathbb {N}}}}_0\) and assume that item (i) holds for \(n=0\), \(n=1\), \(\ldots \), \(n=n\). The induction hypothesis, (18) and Lemma 3.9 imply that for all \(\theta \in \Theta \), \(s\in [0,T]\), \(t\in [s,T]\) it holds that
Combining this with (14) proves for all \(\theta \in \Theta \), \(s\in [0,T]\), \(t\in [s,T]\) that
This finishes the induction step \({{{\mathbb {N}}}}_0 \ni n \rightarrow n+1 \in {{{\mathbb {N}}}}\). Induction hence establishes item (i). Next we note that (18), Lemma 3.9, and a telescope argument yield that for all \(n\in {{{\mathbb {N}}}}_0\), \(\theta \in \Theta \), \(s\in [0,T]\) it holds that
This establishes item (ii). The proof of Lemma 3.10 is thus completed. \(\square \)
The following nonlinear Feynman–Kac formula is essentially known in the literature (cf., e.g., [36, Theorem 5.7.6]) under different assumptions.
Lemma 3.11
(Nonlinear Feynman–Kac formula) Assume the setting in Sect. 3.1, let \(z\in {{{\mathbb {R}}}}^d\), and assume for all \(s\in [0,T]\) that
Then
-
(i)
for all \(s\in [0,T]\) it holds that
$$\begin{aligned} {{{\mathbb {E}}}}\left[ \sup _{t\in [s,T]} | u^{\infty }(t,z+W_{t}^0-W_{s}^0)| +\int _s^T|(F(u^{\infty }))(t,z+W_{t}^0-W_{s}^0)|\,dt \right] <\infty \end{aligned}$$(43)and
-
(ii)
for all \(s\in [0,T]\) it holds that
$$\begin{aligned} \begin{aligned} u^{\infty }(s,z)-{{{\mathbb {E}}}}\!\left[ g(z+W_{T-s}^0)\right]&={{{\mathbb {E}}}}\!\left[ \int _s^{T}(F(u^{\infty }))(t,z+W_{t-s}^0)\,dt \right] . \end{aligned} \end{aligned}$$(44)
Proof
Note that (14) and (42) imply item (i). Next Itô’s formula and the PDE (15) ensure that for all \(s\in [0,T]\), \(t\in [s,T]\) it holds \({{{\mathbb {P}}}}\)-a.s. that
This and (43) show that for all \(s\in [0,T]\) it holds that \({{{\mathbb {E}}}}\big [\sup _{t\in [s,T]}\big | \int _s^t\langle (\nabla _y u^{\infty })(r,z+W_r^0-W_s^0), \,dW_r^0\rangle \big |\big ]<\infty \). This and the dominated convergence theorem ensure for all \(s\in [0,T]\) that \({{{\mathbb {E}}}}\big [ \int _s^T\langle (\nabla _y u^{\infty })(t,z+W_t^0-W_s^0), \,dW_t^0\rangle \big ]=0\). This and (45) prove for all \(s\in [0,T]\) that
This finishes the proof of Lemma 3.11. \(\square \)
Theorem 3.12
Assume the setting in Sect. 3.1, let \(M,Q\in {{{\mathbb {N}}}}\), \(N\in \{1,\ldots ,2Q-1\}\), \(\theta \in \Theta \), and assume for all \(z\in {{{\mathbb {R}}}}^d\), \(s\in [0,T]\) that
Then we have
Proof
Throughout this proof assume w.l.o.g. that the right-hand side of (48) is finite, assume w.l.o.g. that \(\theta =0\) (the case \(\theta \ne 0\) follows from the case \(\theta =0\)), let \({\varepsilon }\in [0,\infty )\) be the real number given by (cf. item (i) of Lemma 3.11)
and let \( (e_n)_{n\in \{0,1,\ldots ,N\}}\subseteq [0,\infty ] \) be the extended real numbers which satisfy for all \(n\in \{0,1,\ldots ,N\}\) that
First, we analyze the Monte Carlo error. Item (i) of Lemma 3.10 shows for all \(n\in {{{\mathbb {N}}}}_{0}\), \((t,z)\in [0,T]\times {{{\mathbb {R}}}}^{d}\), \(s\in [0,t]\) that \({{{\mathbb {E}}}}[|U_{n,M,Q}^0(t,z+W^0_s)|]<\infty \). The triangle inequality, Lemma 3.4, Lemma 3.6, Lemma 3.8, Lemma 3.5, and Lemma 3.9 imply that for all \(n\in {{{\mathbb {N}}}}\), \(k\in \{0,1,\ldots ,2Q-1\}\) it holds that
Next we analyze the time discretization error. Item (ii) of Lemma 3.10 and Item (ii) of Lemma 3.11 ensure that for all \(n\in {{\mathbb {N}}}\), \(s\in [0,T]\), \(z\in {{{\mathbb {R}}}}^d\) it holds that
This, the triangle inequality, Lemma 3.7, the fact that for all \(u\in {\mathcal {M}}({\mathcal {B}}([0,T]\times {{{\mathbb {R}}}}^d),{\mathcal {B}}({{{\mathbb {R}}}}))\), \(k\in {{{\mathbb {N}}}}_{0}\) it holds that \(\Vert u\Vert _{k,Q}\le \sup _{s\in [0,T],t\in [0,s],z\in {{{\mathbb {R}}}}^{d}}\Vert u(s,z+W_t^0)\Vert _{L^2({{{\mathbb {P}}}};{{{\mathbb {R}}}})}\Vert 1\Vert _{k,Q}\), Lemma 3.6, Lemma 3.5, and Lemma 3.8 demonstrate for all \(n\in {{{\mathbb {N}}}}\), \(k\in \{0,1,\ldots ,2Q-1\}\) that
In the next step we combine the established bounds for the Monte Carlo error and the time discretization error to obtain a bound for the global error. More formally, observe that (50) and (52) ensure that for all \(n\in {{{\mathbb {N}}}}\), \(k\in \{0,1,\ldots ,2Q-1\}\) it holds that
Hence, we obtain that for all \(j\in {{{\mathbb {N}}}}_0\), \(n\in {{{\mathbb {N}}}}\), \(k\in \{0,1,\ldots ,2Q-1\}\) it holds that
This shows for all \(n\in \{1,2,\ldots ,N\}\) that
Combining this with the discrete Gronwall-type inequality in Agarwal [1, Corollary 4.1.2] proves that
This completes the proof of Theorem 3.12. \(\square \)
In the proof of the following result, Corollary 3.13, an upper bound for the quadrature error on the right-hand side of (48) is derived under the hypothesis that the solution of the PDE is sufficiently smooth and regular.
Corollary 3.13
Assume the setting in Sect. 3.1, assume that \(u^{\infty }\in C^{\infty }([0,T]\times {{{\mathbb {R}}}}^d,{{{\mathbb {R}}}})\), assume for all \(k\in {{\mathbb {N}}}_0\), \(x\in {{{\mathbb {R}}}}^d\), \(t\in [0,T]\) that
and let \(M,Q\in {{{\mathbb {N}}}}\), \(N\in \{1,\ldots ,2Q-1\}\). Then it holds for all \(\theta \in \Theta \) that
Proof
Throughout this proof assume w.l.o.g. that \(\sup _{z\in {{{\mathbb {R}}}}^d}\sup _{t,s\in [0,T]} {{{\mathbb {E}}}}\left[ |g(z+W_{t}^0)| + |({F(0)})(t,z+W_{s}^0)| \right] <\infty \) (otherwise the right-hand side of (58) is infinite and the proof of (58) is clear). Observe that (57) and the dominated convergence theorem ensure that for every \(k\in {{{\mathbb {N}}}}_{0}\), \(x\in {{{\mathbb {R}}}}^{d}\), \(t\in [0,T]\) it holds that the function
is continuous. The assumption that \(u^{\infty }\in C^{\infty }([0,T]\times {{{\mathbb {R}}}}^d,{{{\mathbb {R}}}})\) and Itô’s formula imply that for all \(x\in {{{\mathbb {R}}}}^d\), \(t\in [0,T]\), \(s\in [t,T]\), \(k\in {{{\mathbb {N}}}}\) it holds \({{\mathbb {P}}}\)-a.s. that
This and (57) show that for all \(x\in {{{\mathbb {R}}}}^d\), \(t\in [0,T]\), \(k\in {{{\mathbb {N}}}}\) it holds that \({{{\mathbb {E}}}}\big [\sup _{s\in [t,T]}\big | \int _t^s \left\langle \left( \nabla _y\big (\tfrac{\partial }{\partial r}+\tfrac{1}{2}\Delta _y\big )^{k}u^{\infty }\right) (v,x+W_{v}^0-W_t^0), \,dW_v^0 \right\rangle \big |\big ]<\infty \). This and the dominated convergence theorem imply that for all \(x\in {{{\mathbb {R}}}}^d\), \(t\in [0,T]\), \(s\in [t,T]\), \(k\in {{{\mathbb {N}}}}\) it holds that \({{{\mathbb {E}}}}\big [ \int _t^s \left\langle \left( \nabla _y(\tfrac{\partial }{\partial r}+\tfrac{1}{2}\Delta _y)^{k}u^{\infty }\right) (v,x+W_{v}^0-W_t^0), \,dW_v^0 \right\rangle \big ]=0\). This, (60), and Fubini’s theorem show that for all \(x\in {{{\mathbb {R}}}}^{d}\), \(t\in [0,T]\), \(s\in [t,T]\), \(k\in {{{\mathbb {N}}}}\) it holds that
Equation (61) (with \(k=1\)) together with (59) (with \(k=2\)) implies for every \(x\in {{{\mathbb {R}}}}^d\), \(t\in [0,T)\) that the function \([t,T]\ni s\mapsto {{{\mathbb {E}}}}\!\left[ \left( \big (\tfrac{\partial }{\partial r}+\tfrac{1}{2}\Delta _y\big )u^{\infty }\right) (s,x+W_{s}^0-W_t^0) \right] \in {{{\mathbb {R}}}}\) is continuously differentiable. Induction, (59), and (61) prove that for every \(x\in {{{\mathbb {R}}}}^{d}\), \(t\in [0,T]\) it holds that the function \([t,T]\ni s\mapsto {{{\mathbb {E}}}}\!\left[ \left( \big (\tfrac{\partial }{\partial r}+\tfrac{1}{2}\Delta _y\big )u^{\infty }\right) (s,x+W_{s}^0-W_t^0) \right] \in {{{\mathbb {R}}}}\) is infinitely often differentiable. This, induction, and (61) demonstrate that for all \(k\in {{{\mathbb {N}}}}\), \(x\in {{{\mathbb {R}}}}^{d}\), \(t\in [0,T)\), \(s\in [t,T]\) it holds that
Equation (15) and the error representation for the Gauß-Legendre quadrature rule (see, e.g., [15, Display (2.7.12)]) imply for all \(x\in {{{\mathbb {R}}}}^{d}\), \(t\in [0,T)\) that there exists a real number \(\xi \in [t,T]\) such that
This and (62) prove that
Theorem 3.12 together with (64) implies (58). The proof of Corollary 3.13 is thus completed. \(\square \)
The following result, Corollary 3.14, establishes an upper bound for the \(L^2\)-error between the solution of the PDE and our approximations (18) if the \(\sup \)-norm of the n-th derivative of the solution of the PDE grows sufficiently slowly as \({{{\mathbb {N}}}}\ni n\rightarrow \infty \).
Corollary 3.14
Assume the setting in Sect. 3.1, assume that \(u^{\infty }\in C^{\infty }([0,T]\times {{{\mathbb {R}}}}^{d},{{{\mathbb {R}}}})\), let \(\alpha \in [0,\frac{1}{4}]\), and let \(C\in [0,\infty ]\) be the extended real number given by
Then it holds for all \(M,Q\in {{{\mathbb {N}}}}\), \(N\in \{1,\ldots ,2Q-1\}\) that
Proof
To prove (66) we assume w.l.o.g. that \(C\in [0,\infty )\). Observe that the Stirling-type formula in Robbins [44, Displays (1)–(2)] proves for all \(n\in {{\mathbb {N}}}\) that
This together with the fact that \(\sqrt{e}\le 2\) and the fact that \(\forall \, n\in {{{\mathbb {N}}}}{:} \pi e^{\frac{1}{3}}n\le 8^{n}\) shows for all \(n\in {{{\mathbb {N}}}}\) that
Next note that Lemma 3.2 and (19) imply that for all \(Q\in {{{\mathbb {N}}}}\), \(i\in \{0,1,\ldots ,2Q-1\}\) it holds that
The assumption that \(C\in [0,\infty )\) allows us to apply Corollary 3.13 to obtain for all \(M,Q\in {{{\mathbb {N}}}}\), \(N\in \{1,\ldots ,2Q-1\}\) that
This, (68), and the fact that \(\sup _{i\in \{0,1,\ldots ,N\}} \tfrac{( \sqrt{M}T)^{i}}{i!}\le e^{T\sqrt{M}}\) imply for all \(M,Q\in {{{\mathbb {N}}}}\), \(N\in \{1,\ldots ,2Q-1\}\) that
This establishes (66). The proof of Corollary 3.14 is thus completed. \(\square \)
The next result, Corollary 3.15, provides an upper bound for the \(L^2\)-error between the solution of the PDE and our approximations (18) if the parameters \(N,M,Q\in {{{\mathbb {N}}}}\) satisfy \(N=M=Q\). Corollary 3.15 is a direct consequence of Corollary 3.14.
Corollary 3.15
Assume the setting in Sect. 3.1, assume that \(u^{\infty }\in C^{\infty }([0,T]\times {{{\mathbb {R}}}}^{d},{{{\mathbb {R}}}})\), let \(\alpha \in [0,\frac{1}{4}]\), and let \(C\in [0,\infty ]\) be the extended real number given by
Then it holds for all \(N\in {{\mathbb {N}}}\) that
3.7 Analysis of the computational complexity and overall rate of convergence
In Lemma 3.16\( {\text {RN}}_{n,M,Q} \) is the number of realizations of a scalar standard normal random variable used to compute one realization of the random variable \( U_{n,M,Q}^{ \theta }( t, x ) :\Omega \rightarrow {{\mathbb {R}}}. \) In Lemma 3.17\( {\text {FE}}_{n,M,Q} \) is the number of function evaluations of f and g used to compute one realization of \( U_{n,M,Q}^{ \theta }( t, x ) :\Omega \rightarrow {{\mathbb {R}}}\).
Lemma 3.16
Assume the setting in Sect. 3.1 and let \(({{\text {RN}}}_{n,M,Q})_{n,M,Q\in {{{\mathbb {Z}}}}}\subseteq {{{\mathbb {N}}}}_{0}\) be natural numbers which satisfy for all \(n,M,Q \in {{{\mathbb {N}}}}\) that \({{\text {RN}}}_{0,M,Q}=0\) and
Then for all \(N\in {{{\mathbb {N}}}}\), we have
Proof
Inequality (74) implies for all \( n, Q \in {{{\mathbb {N}}}} \), \(M \in {{{\mathbb {N}}}}\cap [2,\infty )\) that
The fact that \(\forall \, M,Q \in {{{\mathbb {N}}}}{:}{{\text {RN}}}_{0,M,Q}=0\) and the discrete Gronwall-type inequality in Agarwal [1, Corollary 4.1.2] hence prove that for all \( n, Q \in {{{\mathbb {N}}}} \), \(M \in {{{\mathbb {N}}}}\cap [2,\infty )\) it holds that
Hence, we obtain that for all \(N\in {{{\mathbb {N}}}}\cap [2,\infty )\) it holds that
This and the fact that \({{\text {RN}}}_{ 1,1,1 }\le 2d\) complete the proof of Lemma 3.16. \(\square \)
Lemma 3.17
Assume the setting in Sect. 3.1 and let \(({{\text {FE}}}_{n,M,Q})_{n,M,Q\in {{{\mathbb {Z}}}}}\subseteq {{{\mathbb {N}}}}_{0}\) be natural numbers which satisfy for all \(n,M,Q \in {{{\mathbb {N}}}}\) that \({{\text {FE}}}_{0,M,Q}=0\) and
Then for all \(N\in {{\mathbb {N}}}\), we have
The proof of Lemma 3.17 is analogous to the proof of Lemma 3.16 and therefore omitted. In the proof of Corollary 3.18 below we combine Lemma 3.16 and Lemma 3.17 with Corollary 3.15 to obtain a bound for the computational complexity of the scheme (18) in terms of the space dimension and the prescribed approximation accuracy.
The following corollary, Corollary 3.18, proves under suitable assumptions for every \(\alpha \in (0,\frac{1}{4}]\) and every \(\delta \in (0,\infty )\) that the computational effort of the approximation method (number of function evaluations of the coefficient functions of the considered PDE and number of used independent scalar standard normal random variables, cf. Section 3.7) is at most \(O(d\,{{\varepsilon }}^{-(\frac{1}{\alpha }+\delta )})\) where \({{\varepsilon }}\in (0,\infty )\) is the prescribed approximation accuracy and \(d\in {{\mathbb {N}}}\) is the dimension of the considered PDE.
Corollary 3.18
Assume the setting in Sect. 3.1, assume that \(u^{\infty }\in C^{\infty }([0,T]\times {{{\mathbb {R}}}}^{d},{{{\mathbb {R}}}})\), let \(\alpha \in (0,\frac{1}{4}]\), \(\delta \in (0,\infty )\), let \(C\in [0,\infty )\), assume that
let \(({{\text {RN}}}_{n,M,Q})_{n,M,Q\in {{{\mathbb {Z}}}}}\subseteq {{{\mathbb {N}}}}_{0}\) be natural numbers which satisfy for all \(n,M,Q \in {{{\mathbb {N}}}}\) that \({{\text {RN}}}_{0,M,Q}=0\) and
(for every \(N\in {{{\mathbb {N}}}}\) we think of \({{\text {RN}}}_{ N,N,N }\) as the number of realizations of a scalar standard normal random variable required to compute one realization of the random variable \(U^{0}_{N,N,N}(0,0){:}{\Omega }\rightarrow {{{\mathbb {R}}}}\)), and let \(( {{\text {FE}}}_{n,M,Q})_{n,M,Q\in {{{\mathbb {Z}}}}}\subseteq {{{\mathbb {N}}}}_{0}\) be natural numbers which satisfy for all \(n,M,Q \in {{\mathbb {N}}}\) that \({{\text {FE}}}_{0,M,Q}=\) and
(for every \(N\in {{{\mathbb {N}}}}\) we think of \({{\text {FE}}}_{ N,N,N }\) as the number of function evaluations of f and g required to compute one realization of the random variable \(U^{0}_{N,N,N}(0,0):\Omega \rightarrow {{{\mathbb {R}}}}\)). Then
-
(i)
it holds that
$$\begin{aligned} \limsup _{N\rightarrow \infty }\left[ \sup _{(t,x)\in [0,T]\times {{{\mathbb {R}}}}^{d}}\left\| U_{N,N,N}^{0}(t,x)-u^{\infty }(t,x)\right\| _{L^2({{{\mathbb {P}}}};{{{\mathbb {R}}}})}\right] =0 \end{aligned}$$(82)and
-
(ii)
it holds for all \(N\in {{\mathbb {N}}}\) that
$$\begin{aligned} \begin{aligned} {{\text {RN}}}_{N,N,N}+{{\text {FE}}}_{N,N,N} \le Cd \left[ \sup _{(t,x)\in [0,T]\times {{{\mathbb {R}}}}^{d}}\left\| U_{N,N,N}^{0}(t,x)-u^{\infty }(t,x)\right\| _{L^2({{{\mathbb {P}}}};{{{\mathbb {R}}}})}\right] ^{-\left( \frac{1}{\alpha }+\delta \right) }. \end{aligned}\nonumber \\ \end{aligned}$$(83)
Proof
Throughout this proof let \({\tilde{C}} \in [0,\infty )\) be the real number given by \({\tilde{C}}=\frac{1}{16}\exp \!\left( -2\alpha \delta [e^T(1+2L)]^{\frac{1+\alpha \delta }{2\alpha ^2 \delta }}\right) C\). First note that Corollary 3.15 proves item (i). Next observe that Corollary 3.15, Lemma 3.16, and Lemma 3.17 prove that for all \(N\in {{{\mathbb {N}}}}\) it holds that
This and the fact that \(\forall \, N\in {{{\mathbb {N}}}}:N!\le N^N\) show that for all \(N\in {{{\mathbb {N}}}}\) it holds that
This completes the proof of Corollary 3.18. \(\square \)
The next result, Corollary 3.19, specializes Corollary 3.18 to the case \(\alpha =\frac{1}{4}\).
Corollary 3.19
Assume the setting in Sect. 3.1, assume that \(u^{\infty }\in C^{\infty }([0,T]\times {{{\mathbb {R}}}}^{d},{{{\mathbb {R}}}})\), let \(\delta \in (0,\infty )\), let \(C\in [0,\infty )\), assume that
let \(({\text {RN}}_{n,M,Q})_{n,M,Q\in {{{\mathbb {Z}}}}}\subseteq {{{\mathbb {N}}}}_{0}\) be natural numbers which satisfy for all \(n,M,Q \in {{{\mathbb {N}}}}\) that \({\text {RN}}_{0,M,Q}=0\) and
(for every \(N\in {{{\mathbb {N}}}}\) we think of \({{\text {RN}}}_{ N,N,N }\) as the number of realizations of a scalar standard normal random variable required to compute one realization of the random variable \(U^{0}_{N,N,N}(0,0):\Omega \rightarrow {{{\mathbb {R}}}}\)), and let \(( {{\text {FE}}}_{n,M,Q})_{n,M,Q\in {{{\mathbb {Z}}}}}\subseteq {{{\mathbb {N}}}}_0\) be natural numbers which satisfy for all \(n,M,Q \in {{{\mathbb {N}}}}\) that \({{\text {FE}}}_{0,M,Q}=\) and
(for every \(N\in {{{\mathbb {N}}}}\) we think of \({{\text {FE}}}_{ N,N,N }\) as the number of function evaluations of f and g required to compute one realization of the random variable \(U^{0}_{N,N,N}(0,0):\Omega \rightarrow {{{\mathbb {R}}}}\)). Then
-
(i)
it holds that
$$\begin{aligned} \limsup _{N\rightarrow \infty }\left[ \sup _{(t,x)\in [0,T]\times {{\mathbb {R}}}^d}\left\| U_{N,N,N}^{0}(t,x)-u^{\infty }(t,x)\right\| _{L^2({{\mathbb {P}}};{{\mathbb {R}}})}\right] =0 \end{aligned}$$(89)and
-
(ii)
it holds for all \(N\in {{\mathbb {N}}}\) that
$$\begin{aligned} \begin{aligned} {\text {RN}}_{N,N,N}+{\text {FE}}_{N,N,N} \le Cd \left[ \sup _{(t,x)\in [0,T]\times {{{\mathbb {R}}}}^{d}}\left\| U_{N,N,N}^{0}(t,x)-u^{\infty }(t,x)\right\| _{L^2({{\mathbb {P}}};{{\mathbb {R}}})}\right] ^{-\left( 4+\delta \right) }. \end{aligned}\nonumber \\ \end{aligned}$$(90)
3.8 An example PDE
In this subsection we prove for a non-linear example that the assumptions of Corollary 3.19 are satisfied. For this, we construct an example with an explicit solution so that we can easily check condition (86). Throughout this subsection let \(d\in {{\mathbb {N}}}\), let \(g\in C^{\infty }({{\mathbb {R}}}^d,{{\mathbb {R}}})\), \(u^{\infty }=(u^{\infty }(t,x))_{(t,x)\in [0,1]\times {{\mathbb {R}}}^d}\in C^{\infty }([0,1]\times {{\mathbb {R}}}^d,{{\mathbb {R}}})\), \( f:[0,1]\times {{\mathbb {R}}}^d \times {{\mathbb {R}}}\rightarrow {{\mathbb {R}}}\) be the functions which satisfy for all \((t,x,y)\in [0,1]\times {{\mathbb {R}}}^d\times {{\mathbb {R}}}\) that \( f(t,x,y)= \min \{y^2,1\} +\cos (\frac{\sqrt{2}}{\sqrt{d}}\sum _{i=1}^dx_i)\Big (1-\cos (\frac{\sqrt{2}}{\sqrt{d}}\sum _{i=1}^dx_i)\Big )\) and \(u^\infty (t,x)=g(x)=\cos (\frac{\sqrt{2}}{\sqrt{d}}\sum _{i=1}^dx_i)\). Then f satisfies the Lipschitz-type condition (14) and it holds for all \((t,x)\in [0,1]\times {{\mathbb {R}}}^d\) that
so that \(u^{\infty }\) is a solution of the PDE (15). Moreover it holds for all \((t,x)\in [0,1]\times {{{\mathbb {R}}}}^{d}\), \(k\in {{{\mathbb {N}}}}_0\) that
so that condition (86) is satisfied. Consequently, on a suitable probability space, Corollary 3.19 implies for every \({{\varepsilon }}\in (0,1/4)\) that there exist approximations of \(u^{\infty }(0,0)\) which converge with \(L^2\)-convergence rate at least \(1/4-{{\varepsilon }}\).
References
Agarwal, R.: Difference equations and inequalities: theory, methods, and applications. CRC Press, Chapman & Hall (2000). (CRC Pure and Applied Mathematics)
Albeverio, S., Röckner, M.: Stochastic differential equations in infinite dimensions: solutions via Dirichlet forms. Probab. Theory Relat. Fields 89(3), 347–386 (1991)
Bally, V., Pagès, G.: A quantization algorithm for solving multi-dimensional discrete-time optimal stopping problems. Bernoulli 9(6), 1003–1049 (2003)
Beck, C., Hornung, F., Hutzenthaler, M., Jentzen, A., 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. J. Numer. Math. 28(4), 197–222 (2020)
Bellman, R.: Dynamic programming. Princeton landmarks in mathematics, Princeton University Press, Princeton (2010). (Reprint of the 1957 edition, With a new introduction by Stuart Dreyfus)
Bender, C., Denk, R.: A forward scheme for backward SDEs. Stochastic Process. Appl. 117(12), 1793–1812 (2007)
Bergman, Y.Z.: Option pricing with differential interest rates. Rev. Financ. Stud. 8(2), 475–500 (1995)
Bouchard, B., Touzi, N.: Discrete-time approximation and Monte-Carlo simulation of backward stochastic differential equations. Stochastic Process. Appl. 111(2), 175–206 (2004)
Briand, P., Labart, C.: Simulation of BSDEs by Wiener chaos expansion. Ann. Appl. Probab. 24(3), 1129–1171 (2014)
Burgard, C., Kjaer, M.: Partial differential equation representations of derivatives with bilateral counterparty risk and funding costs. J. Credit Risk 7(3), 1–19 (2011)
Chassagneux, J.-F.: Linear multistep schemes for BSDEs. SIAM J. Numer. Anal. 52(6), 2815–2836 (2014)
Creutzig, J., Dereich, S., Müller-Gronbach, T., Ritter, K.: Infinite-dimensional quadrature and approximation of distributions. Found. Comput. Math. 9(4), 391–429 (2009)
Crisan, D., Manolarakis, K.: Solving backward stochastic differential equations using the cubature method: application to nonlinear pricing. SIAM J. Financ. Math. 3(1), 534–571 (2012)
Da Prato, G., Zabczyk, J.: Differentiability of the Feynman–Kac semigroup and a control application. Atti Accad. Naz. Lincei Cl. Sci. Fis. Mat. Natur. Rend. Lincei (9) Mat. Appl. 8(3), 183–188 (1997)
Davis, P. J., Rabinowitz, P.: Methods of numerical integration. Courier Corpor. (2007)
Duffie, D., Schroder, M., Skiadas, C.: Recursive valuation of defaultable securities and the timing of resolution of uncertainty. Ann. Appl. Probab. 6(4), 1075–1090 (1996)
E, W., Hutzenthaler, M., Jentzen, A., Kruse, T.: On multilevel Picard numerical approximations for high-dimensional nonlinear parabolic partial differential equations and high-dimensional nonlinear backward stochastic differential equations. J. Sci. Comput. 79(3), 1534–1571 (2019)
Elworthy, K., Li, X.-M.: Formulae for the derivatives of heat semigroups. J. Funct. Anal. 125(1), 252–286 (1994)
Giles, M.B.: Improved multilevel Monte Carlo convergence using the Milstein scheme. In Monte Carlo and quasi-Monte Carlo methods. Springer, Berlin 2008, 343–358 (2006)
Giles, M.B.: Multilevel Monte Carlo path simulation. Oper. Res. 56(3), 607–617 (2008)
Gobet, E., Labart, C.: Solving BSDE with adaptive control variate. SIAM J. Numer. Anal. 48(1), 257–277 (2010)
Gobet, E., Lemor, J.-P., Warin, X.: A regression-based Monte Carlo method to solve backward stochastic differential equations. Ann. Appl. Probab. 15(3), 2172–2202 (2005)
Graham, C., Talay, D.: Stochastic simulation and Monte Carlo methods, vol. 68 of Stochastic Modelling and Applied Probability. Springer, Heidelberg, (2013). Mathematical foundations of stochastic simulation
Gyöngy, I., Krylov, N.: Existence of strong solutions for Itô’s stochastic equations via approximations. Probab. Theory Relat. Fields 105(2), 143–158 (1996)
Heinrich, S.: Monte Carlo complexity of global solution of integral equations. J. Complex. 14(2), 151–175 (1998)
Heinrich, S.: Multilevel Monte Carlo Methods. In Large-Scale Scientific Computing, vol. 2179 of Lecture Notes in Computer Science. Springer, pp. 58–67 (2001)
Henry-Labordère, P.: Counterparty risk valuation: a marked branching diffusion approach. arXiv:1203.2369, 17 pages (2012)
Henry-Labordère, P., Oudjane, N., Tan, X., Touzi, N., Warin, X.: Branching diffusion representation of semilinear PDEs and Monte Carlo approximation. Ann. Inst. H. Poincaré Probab. Statist. 55(1), 184–210 (2019)
Henry-Labordère, P., Tan, X., Touzi, N.: A numerical algorithm for a class of BSDEs via the branching process. Stochastic Process. Appl. 124(2), 1112–1140 (2014)
Hutzenthaler, M., Jentzen, A.: On a perturbation theory and on strong convergence rates for stochastic ordinary and partial differential equations with non-globally monotone coefficients. Ann. Probab. 48(1), 53–93 (2020)
Hutzenthaler, M., Jentzen, A., Kloeden, P.E.: Strong convergence of an explicit numerical method for SDEs with nonglobally Lipschitz continuous coefficients. Ann. Appl. Probab. 22(4), 1611–1641 (2012)
Hutzenthaler, M., Jentzen, A., Kruse, T., Nguyen, T.A.: A proof that rectified deep neural networks overcome the curse of dimensionality in the numerical approximation of semilinear heat equations. SN Partial Differ. Equ. Appl. 1, 1–34 (2020)
Hutzenthaler, M., Jentzen, A., Kruse, T., Nguyen, T.A., von Wurstemberger, P.: Overcoming the curse of dimensionality in the numerical approximation of semilinear parabolic partial differential equations. Proc. Roy. Soc. A 476(2244), 20190630 (2020)
Hutzenthaler, M., Jentzen, A., von Wurstemberger, P.: Overcoming the curse of dimensionality in the approximative pricing of financial derivatives with default risks. Electron. J. Probab. 25, (2020)
Hutzenthaler, M., Kruse, T.: Multilevel Picard approximations of high-dimensional semilinear parabolic differential equations with gradient-dependent nonlinearities. SIAM J. Numer. Anal. 58(2), 929–961 (2020)
Karatzas, I., Shreve, S.E.: Brownian motion and stochastic calculus, second ed., vol. 113 of Graduate Texts in Mathematics. Springer-Verlag, New York (1991)
Kebaier, A.: Statistical Romberg extrapolation: a new variance reduction method and applications to option pricing. Ann. Appl. Probab. 15(4), 2681–2705 (2005)
Kloeden, P.E., Platen, E.: Numerical solution of stochastic differential equations, vol. 23 of applications of mathematics (New York), p. 632. Springer-Verlag, Berlin (1992)
Maruyama, G.: Continuous Markov processes and stochastic equations. Rend. Circ. Mat. Palermo (2) 4, 48–90 (1955)
Pardoux, É., Peng, S.: Backward., stochastic differential equations and quasilinear parabolic partial differential equations. In Stochastic partial differential equations and their applications (Charlotte, NC, : vol. 176 of Lecture Notes in Control and Inform. Sci. Springer, Berlin 1992, 200–217 (1991)
Pardoux, É., Peng, S.G.: Adapted solution of a backward stochastic differential equation. Syst. Control Lett. 14(1), 55–61 (1990)
Peng, S.G.: Probabilistic interpretation for systems of quasilinear parabolic partial differential equations. Stochastics Stochastics Rep. 37(1–2), 61–74 (1991)
Prévôt, C., Röckner, M.: A concise course on stochastic partial differential equations, vol. 1905 of Lecture Notes in Mathematics. Springer, Berlin. 144 pages (2007)
Robbins, H.: A remark on stirling’s formula. Am. Math. Monthly 62(1), 26–29 (1955)
Skorohod, A.V.: Branching diffusion processes. Teor. Verojatnost. i Primenen. 9, 492–497 (1964)
Yong, J., Zhou, X. Y.: Stochastic controls, vol. 43 of Applications of Mathematics (New York). Springer-Verlag, New York, (1999). Hamiltonian systems and HJB equations
Zhang, J.: A numerical scheme for BSDEs. Ann. Appl. Probab. 14(1), 459–488 (2004)
Acknowledgements
This work has been funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy EXC 2044 – 390685587, Mathematics Münster: Dynamics – Geometry – Structure, by the Deutsche Forschungsgemeinschaft via research grant HU 1889/6-1, and through the research grants ONR N00014-13-1-0338 and DOE DE-SC0009248.
Author information
Authors and Affiliations
Corresponding author
Additional information
This article is part of the topical collection “Deep learning and PDEs” edited by Arnulf Jentzen, Lin Lin, Siddhartha Mishra, and Lexing Ying.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
E, W., Hutzenthaler, M., Jentzen, A. et al. Multilevel Picard iterations for solving smooth semilinear parabolic heat equations. Partial Differ. Equ. Appl. 2, 80 (2021). https://doi.org/10.1007/s42985-021-00089-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s42985-021-00089-5
Keywords
- Curse of dimensionality
- High-dimensional PDEs
- High-dimensional semilinear BSDEs
- Multilevel Picard iteration
- Multilevel Monte Carlo method