On Dimension-independent Rates of Convergence for Function Approximation with Gaussian Kernels
DOI10.1137/10080138XzbMath1243.65025arXiv1012.2605OpenAlexW2049196399MaRDI QIDQ2882341
Gregory E. Fasshauer, Fred J. Hickernell, Henryk Woźniakowski
Publication date: 4 May 2012
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.2605
algorithmconvergenceerror boundsreproducing kernel Hilbert spaceslinear functionalGaussian kerneltractabilityshape parameterKriging methodworst case
Multidimensional problems (41A63) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (22)
This page was built for publication: On Dimension-independent Rates of Convergence for Function Approximation with Gaussian Kernels