Multilevel lattice-based kernel approximation for elliptic PDEs with random coefficients
By: Alexander D. Gilbert , Michael B. Giles , Frances Y. Kuo and more
Potential Business Impact:
Speeds up computer math for science problems.
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.
Similar Papers
Exploiting Inexact Computations in Multilevel Sampling Methods
Numerical Analysis
Makes computer simulations run much faster.
Goal-Oriented Adaptive Finite Element Multilevel Quasi-{M}onte {C}arlo
Numerical Analysis
Makes computer models of science problems faster.
A Budgeted Multi-Level Monte Carlo Method for Full Field Estimates of Multi-PDE Problems
Numerical Analysis
Solves hard math problems faster with less computer power.