Worst-case optimal approximation with increasingly flat Gaussian kernels

DOI10.1007/S10444-020-09767-1MaRDI QIDQ6320036arXivFDO

Authors Toni Karvonen, Simo Särkkä

Publication date 5 June 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10444-020-09767-1

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by other special function classes (41A30) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Numerical analysis (65-XX) Numerical interpolation (65D05) Numerical quadrature and cubature formulas (65D32)

arXiv classification

cs.NAmath.FAmath.NA

Abstract: We study worst-case optimal approximation of positive linear functionals in reproducing kernel Hilbert spaces induced by increasingly flat Gaussian kernels. This provides a new perspective and some generalisations to the problem of interpolation with increasingly flat radial basis functions. When the evaluation points are fixed and unisolvent, we show that the worst-case optimal method converges to a polynomial method. In an additional one-dimensional extension, we allow also the points to be selected optimally and show that in this case convergence is to the unique Gaussian quadrature type method that achieves the maximal polynomial degree of exactness. The proofs are based on an explicit characterisation of the reproducing kernel Hilbert space of the Gaussian kernel in terms of exponentially damped polynomials.

This page was built for publication: Worst-case optimal approximation with increasingly flat Gaussian kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320036)