Variations on branching methods for non linear PDEs

Abstract

The branching methods developed are effective methods to solve some semi linear PDEs and are shown numerically to be able to solve some full non linear PDEs. These methods are however restricted to some small coefficients in the PDE and small maturities. This article shows numerically that these methods can be adapted to solve the problems with longer maturities in the semi-linear case by using a new derivation scheme and some nested method. As for the case of full non linear PDEs, we introduce new schemes and we show numerically that they provide an effective alternative to the schemes previously developed.

25 pages

Cited by in corpus (6)

• Machine learning approximation algorithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations
• Algorithms for Solving High Dimensional PDEs: From Nonlinear Monte Carlo to Machine Learning
• An overview on deep learning-based approximation methods for partial differential equations
• Overcoming the curse of dimensionality in the approximative pricing of financial derivatives with default risks
• Generalised multilevel Picard approximations
• Monte Carlo for high-dimensional degenerated Semi Linear and Full Non Linear PDEs