Regularity analysis for stochastic partial differential equations with nonlinear multiplicative trace class noise

In this article spatial and temporal regularity of the solution process of a stochastic partial differential equation (SPDE) of evolutionary type with nonlinear multiplicative trace class noise is analyzed.     

Machine Learning Approximation Algorithms for High-Dimensional Fully Nonlinear Partial Differential Equations and Second-order Backward Stochastic Differential Equations

High-dimensional partial differential equations (PDEs) appear in a number of models from the financial industry, such as in derivative pricing models, credit valuation adjustment models, or portfolio optimization models. The PDEs in such applications are high-dimensional as the dimension corresponds to the number of financial assets in a portfolio. Moreover, such PDEs are often fully nonlinear due to the need to incorporate certain nonlinear phenomena in the model such as default risks, transaction costs, volatility uncertainty (Knightian uncertainty), or trading constraints in the model. Such high-dimensional fully nonlinear PDEs are exceedingly difficult to solve as the computational effort for standard approximation methods grows exponentially with the dimension. In this work, we propose a new method for solving high-dimensional fully nonlinear second-order PDEs. Our method can in particular be used to sample from high-dimensional nonlinear expectations. The method is based on (1) a connection between fully nonlinear second-order PDEs and second-order backward stochastic differential equations (2BSDEs), (2) a merged formulation of the PDE and the 2BSDE problem, (3) a temporal forward discretization of the 2BSDE and a spatial approximation via deep neural nets, and (4) a stochastic gradient descent-type optimization procedure. Numerical results obtained using TensorFlow in Python illustrate the efficiency and the accuracy of the method in the cases of a 100-dimensional Black–Scholes–Barenblatt equation, a 100-dimensional Hamilton–Jacobi–Bellman equation, and a nonlinear expectation of a 100-dimensional G-Brownian motion.

     

A random Euler scheme for Carathéodory differential equations

We study a random Euler scheme for the approximation of Carathéodory differential equations and give a precise error analysis. In particular, we show that under weak assumptions, this approximation scheme obtains the same rate of convergence as the classical Monte–Carlo method for integration problems.     

Exponential moment bounds and strong convergence rates for tamed-truncated numerical approximations of stochastic convolutions

Numerical Algorithms - In this article we establish exponential moment bounds, moment bounds in fractional order smoothness spaces, a uniform Hölder continuity in time, and strong convergence...     

Pathwise Numerical Approximations of SPDEs with Additive Noise under Non-global Lipschitz Coefficients

We consider the pathwise numerical approximation of nonlinear parabolic stochastic partial differential equations (SPDEs) driven by additive white noise under local assumptions on the coefficients only. We avoid the standard global Lipschitz assumption in the literature on the coefficients by first showing convergence under global Lipschitz coefficients but with a strong error criteria and then by applying a localization technique for one sample path on a bounded set.     

Pathwise Taylor schemes for random ordinary differential equations

Random ordinary differential equations (RODEs) are ordinary differential equations which contain a stochastic process in their vector fields. They can be analyzed pathwise using deterministic calculus, but since the driving stochastic process is usually only Hölder continuous in time, the vector field is not differentiable in the time variable. Traditional numerical schemes for ordinary differential equations thus do not achieve their usual order of convergence when applied to RODEs. Nevertheless, deterministic calculus can still be used to derive higher order numerical schemes for RODEs by means of a new kind of integral Taylor expansion. The theory is developed systematically here, applied to illustrative examples involving Brownian motion and fractional Brownian motion as the driving processes and compared with other numerical schemes for RODEs in the literature.     

Regularity Properties for Solutions of Infinite Dimensional Kolmogorov Equations in Hilbert Spaces

Potential Analysis - In this article we establish regularity properties for solutions of infinite dimensional Kolmogorov equations. We prove that if the nonlinear drift coefficients, the nonlinear...     

Strong convergence rates for nonlinearity-truncated Euler-type approximations of stochastic Ginzburg–Landau equations

This article proposes and analyzes explicit and easily implementable temporal numerical approximation schemes for additive noise-driven stochastic partial differential equations (SPDEs) with polynomial nonlinearities such as, e.g., stochastic Ginzburg–Landauequations. We prove essentially sharp strong convergence rates for the considered approximation schemes. Our analysis is carried out for abstract stochastic evolution equations on separable Banach and Hilbert spaces including the above mentioned SPDEs as special cases. We also illustrate our strong convergence rate results by means of a numerical simulation in Matlab.     

Strong convergence for explicit space–time discrete numerical approximation methods for stochastic Burgers equations

In this paper we propose and analyze explicit space–time discrete numerical approximations for additive space–time white noise driven stochastic partial differential equations (SPDEs) with non-globally monotone nonlinearities such as the stochastic Burgers equation with space–time white noise. The main result of this paper proves that the proposed explicit space–time discrete approximation method converges strongly to the solution process of the stochastic Burgers equation with space–time white noise. To the best of our knowledge, the main result of this work is the first result in the literature which establishes strong convergence for a space–time discrete approximation method in the case of the stochastic Burgers equations with space–time white noise.     

Convergence of the Stochastic Euler Scheme for Locally Lipschitz Coefficients

Stochastic differential equations are often simulated with the Monte Carlo Euler method. Convergence of this method is well understood in the case of globally Lipschitz continuous coefficients of the stochastic differential equation. However, the important case of superlinearly growing coefficients has remained an open question. The main difficulty is that numerically weak convergence fails to hold in many cases of superlinearly growing coefficients. In this paper we overcome this difficulty and establish convergence of the Monte Carlo Euler method for a large class of one-dimensional stochastic differential equations whose drift functions have at most polynomial growth.