Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.09639 v5 pith:J5CGH64C submitted 2022-05-19 math.NA cs.NAmath.PR

classification math.NAcs.NAmath.PR
keywords algorithmapproximationsemilinearcomplexityequationsfeynman-kacintegro-differentialmultilevel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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 reciprocal of the prescribed accuracy $\varepsilon$. We also provide a numerical example in up to 10'000 dimensions to demonstrate its applicability.

Discussion (0). Continue with ORCID to comment.

Pith tools