Finite Expression Method for Solving High-Dimensional Partial Differential Equations
This addresses the problem of computational inefficiency in high-dimensional PDEs for scientists and engineers, offering a novel approach with interpretable solutions.
The paper tackles the challenge of solving high-dimensional partial differential equations (PDEs) by introducing the finite expression method (FEX), which approximates solutions with finitely many analytic expressions to avoid the curse of dimensionality, achieving high or machine accuracy with polynomial memory complexity.
Designing efficient and accurate numerical solvers for high-dimensional partial differential equations (PDEs) remains a challenging and important topic in computational science and engineering, mainly due to the "curse of dimensionality" in designing numerical schemes that scale in dimension. This paper introduces a new methodology that seeks an approximate PDE solution in the space of functions with finitely many analytic expressions and, hence, this methodology is named the finite expression method (FEX). It is proved in approximation theory that FEX can avoid the curse of dimensionality. As a proof of concept, a deep reinforcement learning method is proposed to implement FEX for various high-dimensional PDEs in different dimensions, achieving high and even machine accuracy with a memory complexity polynomial in dimension and an amenable time complexity. An approximate solution with finite analytic expressions also provides interpretable insights into the ground truth PDE solution, which can further help to advance the understanding of physical systems and design postprocessing techniques for a refined solution.