TL;DR
This paper extends the full history recursive multilevel Picard (MLP) approximation method to systems of high-dimensional semilinear PDEs, demonstrating its efficiency and accuracy through extensive numerical simulations up to 1000 dimensions.
Contribution
The paper introduces an extension of the MLP approximation method to systems of semilinear PDEs and provides numerical evidence of its effectiveness in high dimensions.
Findings
MLP method accurately approximates high-dimensional PDE solutions
MLP outperforms certain deep learning methods in speed and accuracy
Effective for PDEs up to 1000 dimensions
Abstract
One of the most challenging issues in applied mathematics is to develop and analyze algorithms which are able to approximately compute solutions of high-dimensional nonlinear partial differential equations (PDEs). In particular, it is very hard to develop approximation algorithms which do not suffer under the curse of dimensionality in the sense that the number of computational operations needed by the algorithm to compute an approximation of accuracy grows at most polynomially in both the reciprocal of the required accuracy and the dimension of the PDE. Recently, a new approximation method, the so-called full history recursive multilevel Picard (MLP) approximation method, has been introduced and, until today, this approximation scheme is the only approximation method in the scientific literature which has been proven to overcome the curse…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
