Related papers: Full history recursive multilevel Picard approxima…
In the literatur there exist approximation methods for McKean-Vlasov stochastic differential equations which have a computational effort of order $3$. In this article we introduce full-history recursive multilevel Picard (MLP)…
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…
Full-history recursive multilevel Picard (MLP) approximation schemes have been shown to overcome the curse of dimensionality in the numerical approximation of high-dimensional semilinear partial differential equations (PDEs) with general…
It is one of the most challenging problems in applied mathematics to approximatively solve high-dimensional partial differential equations (PDEs). In particular, most of the numerical approximation schemes studied in the scientific…
We introduce multilevel Picard (MLP) approximations for McKean--Vlasov stochastic differential equations (SDEs) with nonconstant diffusion coefficient. Under standard Lipschitz assumptions on the coefficients, we show that the MLP algorithm…
The approximative calculation of iterated nested expectations is a recurring challenging problem in applications. Nested expectations appear, for example, in the numerical approximation of solutions of backward stochastic differential…
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…
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…
In this article we consider the approximation of expectations w.r.t. probability distributions associated to the solution of partial differential equations (PDEs); this scenario appears routinely in Bayesian inverse problems. In practice,…
One of the most challenging problems in applied mathematics is the approximate solution of nonlinear partial differential equations (PDEs) in high dimensions. Standard deterministic approximation methods like finite differences or finite…
In this paper we consider the filtering problem associated to partially observed McKean-Vlasov stochastic differential equations (SDEs). The model consists of data that are observed at regular and discrete times and the objective is to…
Neufeld and Wu (arXiv:2310.12545) developed a multilevel Picard (MLP) algorithm which can approximately solve general semilinear parabolic PDEs with gradient-dependent nonlinearities, allowing also for coefficient functions of the…
In this article we present and analyse new multilevel adaptations of stochastic approximation algorithms for the computation of a zero of a function $f\colon D \to \mathbb R^d$ defined on a convex domain $D\subset \mathbb R^d$, which is…
We study the approximation of expectations $\E(f(X))$ for solutions $X$ of SDEs and functionals $f \colon C([0,1],\R^r) \to \R$ by means of restricted Monte Carlo algorithms that may only use random bits instead of random numbers. We…
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…
The estimation of repeatedly nested expectations is a challenging task that arises in many real-world systems. However, existing methods generally suffer from high computational costs when the number of nestings becomes large. Fix any…
We study the approximation of expectations $\operatorname{E}(f(X))$ for solutions $X$ of stochastic differential equations and functionals $f$ on the path space by means of Monte Carlo algorithms that only use random bits instead of random…
We generalize the multilevel Monte Carlo (MLMC) method of Giles to the simulation of systems of particles that interact via a mean field. When the number of particles is large, these systems are described by a McKean-Vlasov process - a…
This paper is devoted to order-one explicit approximations of random periodic solutions to multiplicative noise driven stochastic differential equations (SDEs) with non-globally Lipschitz coefficients. The existence of the random periodic…
Partial differential equations (PDEs) are a fundamental tool in the modeling of many real world phenomena. In a number of such real world phenomena the PDEs under consideration contain gradient-dependent nonlinearities and are…