Arnaud Lionnet

NA
4papers
18citations
Novelty33%
AI Score18

4 Papers

NANov 30, 2016
Adapted time steps explicit scheme for monotone BSDEs

Arnaud Lionnet

We study the numerical strong stability of explicit schemes for the numerical approximation of the solution to a BSDE where the driver has polynomial growth in the primary variable and satisfies a monotone decreasing condition, and we introduce an explicit scheme with adapted time-steps that guarantee numerical strong stability. We then prove the convergence of this scheme and illustrate it with numerical simulations.

NAAug 10, 2017
Full-Projection explicit FBSDE scheme for parabolic PDEs with superlinear nonlinearities

Arnaud Lionnet, Gonçalos dos Reis, Lukasz Szpruch

Developing efficient and stable approximations for high dimensional PDEs is of key importance for numerous applications. The language of Forward-Backward Stochastic Differential Equations (FBSDE), with its nonlinear Feynman-Kac formula, allows for purely probabilistic representations of the solution and its gradient for parabolic nonlinear PDEs. In this work we build on the recent results of [Lionnet, dos Reis and Szpruch 2015] by introducing and studying a Full-Projection explicit time-discretization scheme for the approximation of FBSDEs with non-globally Lipschitz drivers of polynomial growth. We establish convergence rates and we show that, unlike classical explicit schemes, it preserves stability properties present in the continuous-time dynamics, in particular, the scheme is able to preserve the possible coercivity/contraction property of the PDE's coefficients. The scheme is then coupled with a quantization-type approximation of the conditional expectations on a space-time grid in order to provide a complete approximation scheme for these FBSDEs/nonlinear PDEs and a full analysis is also carried out. We illustrate our findings with numerical examples.

PRJul 22, 2016
Convergence and qualitative properties of modified explicit schemes for BSDEs with polynomial growth

Arnaud Lionnet, Gonçalo dos Reis, Lukasz Szpruch

The theory of Forward-Backward Stochastic Differential Equations (FBSDEs) paves a way to probabilistic numerical methods for nonlinear parabolic PDEs. The majority of the results on the numerical methods for FBSDEs relies on the global Lipschitz assumption, which is not satisfied for a number of important cases such as the Fisher--KPP or the FitzHugh--Nagumo equations. Furthermore, it has been shown in \cite{LionnetReisSzpruch2015} that for BSDEs with monotone drivers having polynomial growth in the primary variable $y$, only the (sufficiently) implicit schemes converge. But these require an additional computational effort compared to explicit schemes. This article develops a general framework that allows the analysis, in a systematic fashion, of the integrability properties, convergence and qualitative properties (e.g.~comparison theorem) for whole families of modified explicit schemes. The framework yields the convergence of some modified explicit scheme with the same rate as implicit schemes and with the computational cost of the standard explicit scheme. To illustrate our theory, we present several classes of easily implementable modified explicit schemes that can computationally outperform the implicit one and preserve the qualitative properties of the solution to the BSDE. These classes fit into our developed framework and are tested in computational experiments.

PRSep 9, 2015
Time discretization of FBSDE with polynomial growth drivers and reaction-diffusion PDEs

Arnaud Lionnet, Gonçalo dos Reis, Lukasz Szpruch

In this paper, we undertake the error analysis of the time discretization of systems of Forward-Backward Stochastic Differential Equations (FBSDEs) with drivers having polynomial growth and that are also monotone in the state variable. We show with a counter-example that the natural explicit Euler scheme may diverge, unlike in the canonical Lipschitz driver case. This is due to the lack of a certain stability property of the Euler scheme which is essential to obtain convergence. However, a thorough analysis of the family of $θ$-schemes reveals that this required stability property can be recovered if the scheme is sufficiently implicit. As a by-product of our analysis, we shed some light on higher order approximation schemes for FBSDEs under non-Lipschitz condition. We then return to fully explicit schemes and show that an appropriately tamed version of the explicit Euler scheme enjoys the required stability property and as a consequence converges. In order to establish convergence of the several discretizations, we extend the canonical path- and first-order variational regularity results to FBSDEs with polynomial growth drivers which are also monotone. These results are of independent interest for the theory of FBSDEs.