Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification

Vesa Kaarnioja, Yoshihito Kazashi, Frances Y. Kuo, Fabio Nobile, Ian H. Sloan

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)
15 Downloads (Pure)

Abstract

This paper deals with the kernel-based approximation of a multivariate periodic function by interpolation at the points of an integration lattice—a setting that, as pointed out by Zeng et al. (Monte Carlo and Quasi-Monte Carlo Methods 2004, Springer, New York, 2006) and Zeng et al. (Constr. Approx. 30: 529–555, 2009), allows fast evaluation by fast Fourier transform, so avoiding the need for a linear solver. The main contribution of the paper is the application to the approximation problem for uncertainty quantification of elliptic partial differential equations, with the diffusion coefficient given by a random field that is periodic in the stochastic variables, in the model proposed recently by Kaarnioja et al. (SIAM J Numer Anal 58(2): 1068–1091, 2020). The paper gives a full error analysis, and full details of the construction of lattices needed to ensure a good (but inevitably not optimal) rate of convergence and an error bound independent of dimension. Numerical experiments support the theory.
Original languageEnglish
Pages (from-to)33-77
Number of pages45
JournalNumerische Mathematik
Volume150
Early online date30 Nov 2021
DOIs
Publication statusPublished - 31 Jan 2022

Keywords

  • kernel-based approximation
  • fast Fourier transform
  • uncertainty quantification

Fingerprint

Dive into the research topics of 'Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification'. Together they form a unique fingerprint.

Cite this