PofoliaShared via Pofolia

Numerische Mathematik· 2026Q1

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

Alexander D. Gilbert, Michael B. Giles, Frances Y. Kuo, Ian H. Sloan et al.

Short summary

A new multilevel kernel-based approximation method reduces the computational cost for solving elliptic PDEs with random coefficients by up to O(ε⁻(ν-θ)) compared to single-level methods, while achieving the same accuracy ε.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Introduces a multilevel kernel-based approximation for elliptic PDEs with random coefficients.
  • Achieves accuracy ε at a reduced cost of O(ε⁻(η-max(ν,θ))) compared to single-level O(ε⁻(η-ν-θ)).
  • Leverages multilevel techniques to enhance computational efficiency.
  • Provides full regularity theory and error analysis.
  • Numerical experiments validate the method's efficacy against single-level approaches.

AI-generated from the title and abstract; the full text is not read.

Abstract

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 (Numerische Mathematik 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$$ ε > 0 with cost $$\mathcal {O}(\varepsilon ^{-\eta -\nu -\theta })$$ O ( ε - η - ν - θ ) 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 )})$$ O ( ε - η - max ( ν , θ ) ) . 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.

The authors' abstract, as published at the source. Numerische Mathematik, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Numerical Analysis

Numerical AnalysisMathematics