TY - JOUR
T1 - Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification
AU - Kaarnioja, Vesa
AU - Kazashi, Yoshihito
AU - Kuo, Frances Y.
AU - Nobile, Fabio
AU - Sloan, Ian H.
PY - 2022/1/31
Y1 - 2022/1/31
N2 - 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.
AB - 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.
KW - kernel-based approximation
KW - fast Fourier transform
KW - uncertainty quantification
UR - https://www.scopus.com/pages/publications/85120311478
U2 - 10.1007/s00211-021-01242-3
DO - 10.1007/s00211-021-01242-3
M3 - Article
SN - 0029-599X
VL - 150
SP - 33
EP - 77
JO - NUMERISCHE MATHEMATIK
JF - NUMERISCHE MATHEMATIK
ER -