In this work, we investigate the numerical approximation of the second order non-autonomous semilnear parabolic partial differential equation (PDE) using the finite element method. To the best of our knowledge, only the linear case is investigated in the literature. Using an approach based on evolution operator depending on two parameters, we obtain the error estimate of the scheme toward the mild solution of the PDE under polynomial growth condition of the nonlinearity. Our convergence rate are obtain for smooth and non-smooth initial data and is similar to that of the autonomous case. Our convergence result for smooth initial data is very important in numerical analysis. For instance, it is one step forward in approximating non-autonomous stochastic partial differential equations by the finite element method. In addition, we provide realistic conditions on the nonlinearity, appropriated to achieve optimal convergence rate without logarithmic reduction by exploiting the smooth properties of the two parameters evolution operator.
Dozens of exponential integration formulas have been proposed for the high-accuracy solution of stiff PDEs such as the Allen-Cahn, Korteweg-de Vries and Ginzburg-Landau equations. We report the results of extensive comparisons in MATLAB and Chebfun of such formulas in 1D, 2D and 3D, focusing on fourth and higher order methods, and periodic semilinear stiff PDEs with constant coefficients. Our conclusion is that it is hard to do much better than one of the simplest of these formulas, the ETDRK4 scheme of Cox and Matthews.
We formulate and analyze a goal-oriented adaptive finite element method (GOAFEM) for a semilinear elliptic PDE and a linear goal functional. The strategy involves the finite element solution of a linearized dual problem, where the linearization is part of the adaptive strategy. Linear convergence and optimal algebraic convergence rates are shown.
This paper introduces a new approximation scheme for solving high-dimensional semilinear partial differential equations (PDEs) and backward stochastic differential equations (BSDEs). First, we decompose a target semilinear PDE (BSDE) into two parts, namely "dominant" linear and "small" nonlinear PDEs. Then, we employ a Deep BSDE solver with a new control variate method to solve those PDEs, where approximations based on an asymptotic expansion technique are effectively applied to the linear part and also used as control variates for the nonlinear part. Moreover, our theoretical result indicates…
Deep neural networks and other deep learning methods have very successfully been applied to the numerical approximation of high-dimensional nonlinear parabolic partial differential equations (PDEs), which are widely used in finance, engineering, and natural sciences. In particular, simulations indicate that algorithms based on deep learning overcome the curse of dimensionality in the numerical approximation of solutions of semilinear PDEs. For certain linear PDEs this has also been proved mathematically. The key contribution of this article is to rigorously prove this for the first time for a …
We consider applying the Strang splitting to semilinear parabolic problems. The key ingredients of the Strang splitting are the decomposition of the equation into several parts and the computation of approximate solutions by combining the time evolution of each split equation. However, when the Dirichlet boundary condition is imposed, order reduction could occur due to the incompatibility of the split equations with the boundary condition. In this paper, to overcome the order reduction, a modified Strang splitting procedure is presented for the one-dimensional semilinear parabolic equation wit…
Explicit stabilized integrators are an efficient alternative to implicit or semi-implicit methods to avoid the severe timestep restriction faced by standard explicit integrators applied to stiff diffusion problems. In this paper, we provide a fully discrete strong convergence analysis of a family of explicit stabilized methods coupled with finite element methods for a class of parabolic semilinear deterministic and stochastic partial differential equations. Numerical experiments including the semilinear stochastic heat equation with space-time white noise confirm the theoretical findings.
This paper studies the convergence of a spatial semi-discretization for a backward semilinear stochastic parabolic equation. The filtration is general, and the spatial semi-discretization uses the standard continuous piecewise linear element method. Firstly, higher regularity of the solution to the continuous equation is derived. Secondly, the first-order spatial accuracy is derived for the spatial semi-discretization. Thirdly, an application of the theoretical result to a stochastic linear quadratic control problem is presented.
Recently, so-called full-history recursive multilevel Picard (MLP) approximation schemes have been introduced and shown to overcome the curse of dimensionality in the numerical approximation of semilinear parabolic partial differential equations (PDEs) with Lipschitz nonlinearities. The key contribution of this article is to introduce and analyze a new variant of MLP approximation schemes for certain semilinear elliptic PDEs with Lipschitz nonlinearities and to prove that the proposed approximation schemes overcome the curse of dimensionality in the numerical approximation of such semilinear e…
In this paper stability and error estimates for time discretizations of linear and semilinear parabolic equations by the two-step backward differentiation formula (BDF2) method with variable step-sizes are derived. An affirmative answer is provided to the question: whether the upper bound of step-size ratios for the $l^\infty(0,T;H)$-stability of the BDF2 method for linear and semilinear parabolic equations is identical with the upper bound for the zero-stability. The $l^\infty(0,T;V)$-stability of the variable step-size BDF2 method is also established under more relaxed condition on the ratio…
We propose an approximation scheme for a class of semilinear parabolic equations that are convex and coercive in their gradients. Such equations arise often in pricing and portfolio management in incomplete markets and, more broadly, are directly connected to the representation of solutions to backward stochastic differential equations. The proposed scheme is based on splitting the equation in two parts, the first corresponding to a linear parabolic equation and the second to a Hamilton-Jacobi equation. The solutions of these two equations are approximated using, respectively, the Feynman-Kac …
The recently introduced full-history recursive multilevel Picard (MLP) approximation methods have turned out to be quite successful in the numerical approximation of solutions of high-dimensional nonlinear PDEs. In particular, there are mathematical convergence results in the literature which prove that MLP approximation methods do overcome the curse of dimensionality in the numerical approximation of nonlinear second-order PDEs in the sense that the number of computational operations of the proposed MLP approximation method grows at most polynomially in both the reciprocal $1/ε$ of the prescr…
A large class of semilinear parabolic equations satisfy the maximum bound principle (MBP) in the sense that the time-dependent solution preserves for any time a uniform pointwise bound imposed by its initial and boundary conditions. Investigation on numerical schemes of these equations with preservation of the MBP has attracted increasingly attentions in recent years, especially for the temporal discretizations. In this paper, we study high-order MBP-preserving time integration schemes by means of the integrating factor Runge-Kutta (IFRK) method. Beginning with the space-discrete system of sem…
One of the most challenging issues in applied mathematics is to develop and analyze algorithms which are able to approximately compute solutions of high-dimensional nonlinear partial differential equations (PDEs). In particular, it is very hard to develop approximation algorithms which do not suffer under the curse of dimensionality in the sense that the number of computational operations needed by the algorithm to compute an approximation of accuracy $ε> 0$ grows at most polynomially in both the reciprocal $1/ε$ of the required accuracy and the dimension $d \in \mathbb{N}$ of the PDE. Recentl…
The full history recursive multilevel Picard approximation method for semilinear parabolic partial differential equations (PDEs) is the only method which provably overcomes the curse of dimensionality for general time horizons if the coefficient functions and the nonlinearity are globally Lipschitz continuous and the nonlinearity is gradient-independent. In this article we extend this result to locally monotone coefficient functions. Our results cover a range of semilinear PDEs with polynomial coefficient functions.
Preconditioning for the high-order sampling of the invariant distribution of parabolic semilinear SPDEs
Universite de Pau et des Pays de l’Adour, E2S UPPA, CNRS, LMAP（波城大学、E2S 巴约讷-比亚里茨大学、法国国家科学研究中心、数学与及其应用实验室）；Univ Rennes, INRIA (MINGuS), IRMAR - UMR 6625, ENS Rennes（雷恩大学、法国国家信息与自动化研究所（MINGuS）、雷恩数学研究所（UMR 6625）、雷恩高等师范学院）；Univ Rennes, CNRS, IRMAR - UMR 6625, ENS Rennes（雷恩大学、法国国家科学研究中心、雷恩数学研究所（UMR 6625）、雷恩高等师范学院）；Section of Mathematics, University of Geneva（日内瓦大学数学系）
We study an asymptotic preserving scheme for the temporal discretization of a system of parabolic semilinear SPDEs with two time scales. Owing to the averaging principle, when the time scale separation $ε$ vanishes, the slow component converges to the solution of a limiting evolution equation, which is captured when the time-step size $Δt$ vanishes by a limiting scheme. The objective of this work is to prove weak error estimates which are uniform with respect to $ε$, in terms of $Δt$: the scheme satisfies a uniform accuracy property. This is a non trivial generalization of a recent article in …
For a long time it is well-known that high-dimensional linear parabolic partial differential equations (PDEs) can be approximated by Monte Carlo methods with a computational effort which grows polynomially both in the dimension and in the reciprocal of the prescribed accuracy. In other words, linear PDEs do not suffer from the curse of dimensionality. For general semilinear PDEs with Lipschitz coefficients, however, it remained an open question whether these suffer from the curse of dimensionality. In this paper we partially solve this open problem. More precisely, we prove in the case of semi…
Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities
