Score: 1

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

Published: April 22, 2025 | arXiv ID: 2504.15810v1

By: Alexander D. Gilbert , Michael B. Giles , Frances Y. Kuo and more

Potential Business Impact:

Speeds up computer math for science problems.

Business Areas:
Quantum Computing Science and Engineering

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 $\varepsilon>0$ with cost $\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 $\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.

Country of Origin
🇦🇺 🇬🇧 Australia, United Kingdom

Page Count
40 pages

Category
Mathematics:
Numerical Analysis (Math)