• Corpus ID: 245853949

A fully nonlinear Feynman-Kac formula with derivatives of arbitrary orders

@inproceedings{Penent2022AFN,
  title={A fully nonlinear Feynman-Kac formula with derivatives of arbitrary orders},
  author={Guillaume Penent and Nicolas Privault},
  year={2022}
}
We present an algorithm for the numerical solution of nonlinear parabolic partial differential equations. This algorithm extends the classical Feynman-Kac formula to fully nonlinear partial differential equations, by using random trees that carry information on nonlinearities on their branches. It applies to functional, non-polynomial nonlinearities that are not treated by standard branching arguments, and deals with derivative terms of arbitrary orders. A Monte Carlo numerical implementation is… 
[PDF] Semantic Reader
3 Citations
Background Citations
1

Figures from this paper

3 Citations

Numerical solution of the incompressible Navier-Stokes equation by a deep branching algorithm

This approach covers functional nonlinearities involving gradient terms of arbitrary orders and it requires only a boundary condition over space at a given terminal time T instead of Dirichlet or Neumann boundary conditions at all times as in standard solvers.

A deep branching solver for fully nonlinear partial differential equations

Numerical experiments presented show that this algorithm can outperform deep learning approaches based on backward stochastic differential equations or the Galerkin method, and provide solution estimates that are not obtained by those methods in fully nonlinear examples.

Numerical Methods for Backward Stochastic Differential Equations: A Survey

This paper focuses on the core features of each method: the main assumptions, the numerical algorithm itself, key convergence properties and advantages and disadvantages, in order to provide an exhaustive up-to-date coverage of numerical methods for BSDEs, with insightful summaries of each and useful comparison and categorization.

References

SHOWING 1-10 OF 51 REFERENCES

Branching diffusion representation of semilinear PDEs and Monte Carlo approximation

We provide a representation result of parabolic semi-linear PD-Es, with polynomial nonlinearity, by branching diffusion processes. We extend the classical representation for KPP equations, introduced…

Differential learning methods for solving fully nonlinear PDEs

Compared to existing methods, the addition of a differential loss function associated to the gradient, and augmented training sets with Malliavin derivatives of the forward process, yields a better estimation of the PDE’s solution derivatives, in particular of the second derivative, which is usually dfficult to approximate.

Multilevel Picard approximation algorithm for semilinear partial integro-differential equations and its complexity analysis

In this paper we introduce a multilevel Picard approximation algorithm for semilinear parabolic partial integro-differential equations (PIDEs). We prove that the numerical approximation scheme…

Numerical evaluation of ODE solutions by Monte Carlo enumeration of Butcher series

We present an algorithm for the numerical solution of ordinary differential equations by random enumeration of the Butcher trees used in the implementation of the Runge–Kutta method. Our Monte Carlo…

Existence of solutions for nonlinear elliptic PDEs with fractional Laplacians on open balls

We prove the existence of viscosity solutions for fractional semilinear elliptic PDEs on open balls with bounded exterior condition in dimension d ≥ 1. Our approach relies on a tree-based…

Existence and probabilistic representation of the solutions of semilinear parabolic PDEs with fractional Laplacians

We obtain existence results for the solution u of nonlocal semilinear parabolic PDEs on Rd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts}…

Multilevel Picard approximations for high-dimensional semilinear second-order PDEs with Lipschitz nonlinearities

The main result of this article proves that this new MLP approximation method does indeed overcome the curse of dimensionality in the numerical approximation of semilinear second-order PDEs.

Numerical simulations for full history recursive multilevel Picard approximations for systems of high-dimensional partial differential equations

The presented numerical simulation results indicate that the proposed MLP approximation scheme significantly outperforms certain deep learning based approximation methods for high-dimensional semilinear PDEs.

Overcoming the Curse of Dimensionality in the Numerical Approximation of Parabolic Partial Differential Equations with Gradient-Dependent Nonlinearities

There exists no approximation algorithm in the scientific literature which has been proven to overcome the curse of dimensionality in the case of a class of nonlinear PDEs with general time horizons and gradient-dependent nonlinearities.

Neural networks-based backward scheme for fully nonlinear PDEs

A numerical method for solving high dimensional fully nonlinear partial differential equations (PDEs) by backward time induction and multi-layer neural networks through a sequence of learning problems obtained from the minimization of suitable quadratic loss functions and training simulations.
...