Overcoming the curse of dimensionality in the numerical approximation of Allen-Cahn partial differential equations via truncated full-history recursive multilevel Picard approx

07/15/2019
by   Christian Beck, et al.
0

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 elements suffer from the curse of dimensionality in the sense that the computational effort grows exponentially in the dimension. In this work we overcome this difficulty in the case of reaction-diffusion type PDEs with a locally Lipschitz continuous coervice nonlinearity (such as Allen-Cahn PDEs) by introducing and analyzing truncated variants of the recently introduced full-history recursive multilevel Picard approximation schemes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2020

Low rank tensor approximation of singularly perturbed partial differential equations in one dimension

We derive rank bounds on the quantized tensor train (QTT) compressed app...
research
11/08/2019

Generalised multilevel Picard approximations

It is one of the most challenging problems in applied mathematics to app...
research
07/28/2023

From continuous-time formulations to discretization schemes: tensor trains and robust regression for BSDEs and parabolic PDEs

The numerical approximation of partial differential equations (PDEs) pos...
research
05/19/2022

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

In this paper we introduce a multilevel Picard approximation algorithm f...
research
03/26/2021

Multilevel Active-Set Trust-Region (MASTR) Method for Bound Constrained Minimization

We introduce a novel variant of the recursive multilevel trust-region (R...

Please sign up or login with your details

Forgot password? Click here to reset