Higher-Order QMC Galerkin FEM for Singular Perturbation: Reaction-Diffusion with Affine-Parametric Reaction
math.NA, cs.NA
Submitted: 2026-10-29
Updated: 2026-10-29
License: http://creativecommons.org/licenses/by/4.0/
The gist: We analyze higher-order quasi-Monte Carlo (QMC) Galerkin discretizations for a singularly perturbed reaction-diffusion problem with an affine-parametric reaction coefficient.
Terminology
Abstract
We analyze higher-order quasi-Monte Carlo (QMC) Galerkin discretizations for a singularly perturbed reaction-diffusion problem with an affine-parametric reaction coefficient. We derive error estimates that are robust with respect to the perturbation parameter epsilon. To this end, we establish epsilon-uniform stability and mixed-parametric regularity estimates in an epsilon-weighted energy norm, with constants independent of the parameter dimension and of epsilon. These estimates imply robust dimension truncation estimates and dimension-independent higher-order QMC error bounds for linear quantities of interest. Assuming an abstract, epsilon-robust finite element approximation property, we combine the parametric estimates with the spatial discretization analysis to derive a general fully discrete QMC-FE error estimate with constants independent of both the parameter dimension and epsilon. We verify this approximation property for a one-dimensional model problem using continuous piecewise affine finite elements on Shishkin meshes. Numerical experiments illustrate the predicted robustness and convergence rates.
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers