English

Multilevel lattice-based kernel approximation for elliptic PDEs with random coefficients

Numerical Analysis 2025-04-23 v1 Numerical Analysis

Abstract

This paper introduces a multilevel kernel-based approximation method to estimate efficiently solutions to elliptic partial differential equations (PDEs) with periodic random coefficients. Building upon the work of Kaarnioja, Kazashi, Kuo, Nobile, Sloan (Numer. Math., 2022) on kernel interpolation with quasi-Monte Carlo (QMC) lattice point sets, we leverage multilevel techniques to enhance computational efficiency while maintaining a given level of accuracy. In the function space setting with product-type weight parameters, the single-level approximation can achieve an accuracy of ε>0\varepsilon>0 with cost O(εηνθ)\mathcal{O}(\varepsilon^{-\eta-\nu-\theta}) for positive constants η,ν,θ\eta, \nu, \theta depending on the rates of convergence associated with dimension truncation, kernel approximation, and finite element approximation, respectively. Our multilevel approximation can achieve the same ε\varepsilon accuracy at a reduced cost O(εηmax(ν,θ))\mathcal{O}(\varepsilon^{-\eta-\max(\nu,\theta)}). Full regularity theory and error analysis are provided, followed by numerical experiments that validate the efficacy of the proposed multilevel approximation in comparison to the single-level approach.

Keywords

Cite

@article{arxiv.2504.15810,
  title  = {Multilevel lattice-based kernel approximation for elliptic PDEs with random coefficients},
  author = {Alexander D. Gilbert and Michael B. Giles and Frances Y. Kuo and Ian H. Sloan and Abirami Srikumar},
  journal= {arXiv preprint arXiv:2504.15810},
  year   = {2025}
}
R2 v1 2026-06-28T23:07:05.709Z