On the High-Level Error Bound for Gaussian Interpolation

arXivmath/0601159MaRDI QIDQ6476547FDOQ6476547

Authors: Lin-Tian Luh 

Publication date: 8 January 2006

Abstract: It's well-known that there is a very powerful error bound for Gaussians put forward by Madych and Nelson in 1992. It's of the form$\mathrm{\%}|f(x)-s(x)|leq(Cd{)}^{fraccd}leftVertfightVer{t}_h$ where $C,c$ are constants, $h$ is the Gaussian function, $\mathrm{\%}s$ is the interpolating function, and d is called fill distance which, roughly speaking, measures the spacing of the points at which interpolation occurs. This error bound gets small very fast as $do0$. The constants $C$ and $c$ are very sensitive. A slight change of them will result in a huge change of the error bound. The number $c$ can be calculated as shown in [9]. However, $C$ cannot be calculated, or even approximated. This is a famous question in the theory of radial basis functions. The purpose of this paper is to answer this question.

Mathematics Subject Classification ID

Multidimensional problems (41A63) Interpolation in approximation theory (41A05) Spline approximation (41A15) Approximation by other special function classes (41A30) Rate of convergence, degree of approximation (41A25)

This page was built for publication: On the High-Level Error Bound for Gaussian Interpolation

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