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

by   Ariel Neufeld, et al.

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 converges to the unique viscosity solution of the PIDE under consideration. To that end, we derive a Feynman-Kac representation for the unique viscosity solution of the semilinear PIDE, extending the classical Feynman-Kac representation for linear PIDEs. Furthermore, we show that the algorithm does not suffer from the curse of dimensionality, i.e. the computational complexity of the algorithm is bounded polynomially in the dimension d and the prescribed reciprocal of the accuracy ε.



page 1

page 2

page 3

page 4


Multilevel Picard approximations for McKean-Vlasov stochastic differential equations

In the literatur there exist approximation methods for McKean-Vlasov sto...

Full history recursive multilevel Picard approximations for ordinary differential equations with expectations

We consider ordinary differential equations (ODEs) which involve expecta...

Discretization and Machine Learning Approximation of BSDEs with a Constraint on the Gains-Process

We study the approximation of backward stochastic differential equations...

Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm

Bribery in election (or computational social choice in general) is an im...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.