Compressive Fourier collocation methods for high-dimensional diffusion equations with periodic boundary conditions
Not on the map. Why?
Abstract (arXiv)
High-dimensional Partial Differential Equations (PDEs) are a popular mathematical modelling tool, with applications ranging from finance to computational chemistry. However, standard numerical techniques for solving these PDEs are typically affected by the curse of dimensionality. In this work, we tackle this challenge while focusing on stationary diffusion equations defined over a high-dimensional domain with periodic boundary conditions. Inspired by recent progress in sparse function approximation in high dimensions, we propose a new method called compressive Fourier collocation. Combining ideas from compressive sensing and spectral collocation, our method replaces the use of structured collocation grids with Monte Carlo sampling and employs sparse recovery techniques, such as orthogonal matching pursuit and ℓ1 minimization, to approximate the Fourier coefficients of the PDE solution. We conduct a rigorous theoretical analysis showing that the approximation error of the proposed method is comparable with the best s-term approximation (with respect to the Fourier basis) to the solution. Using the recently introduced framework of random sampling in bounded Riesz systems, our analysis shows that the compressive Fourier collocation method mitigates the curse of dimensionality with respect to the number of collocation points under sufficient conditions on the regularity of the diffusion coefficient. We also present numerical experiments that illustrate the accuracy and stability of the method for the approximation of sparse and compressible solutions.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 9 of its 60 references that are in the map. First posted on arXiv 2 Jun 2022.
Builds on
9 of 60 references.
References · 9
- 2017Solving high-dimensional partial differential equations using deep learningcited by 549
- 2019Deep Neural Network Approximation Theorycited by 92
- 2020A Method for Representing Periodic Functions and Enforcing Exactly Periodic Boundary Conditions with Deep Neural Networkscited by 86
- 2020Algorithms for Solving High Dimensional PDEs: From Nonlinear Monte Carlo to Machine Learningcited by 77
- 2020The gap between theory and practice in function approximation with deep neural networkscited by 53
- 2018Analysis of the Generalization Error: Empirical Risk Minimization over Deep Artificial Neural Networks Overcomes the Curse of Dimensionality in the Numerical Approximation of Black-Scholes Partial Differential Equationscited by 44
- 2020Deep neural network approximation for high-dimensional elliptic PDEs with boundary conditionscited by 25
- 2020Deep Neural Networks Are Effective At Learning High-Dimensional Hilbert-Valued Functions From Limited Datacited by 22
- 2013Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-rank Matricescited by 8
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.