On the High-Level Error Bound for Gaussian Interpolation

Publication date 8 January 2006

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

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

% | f (x) - s (x) | l e q (C d)^{f r a c c d} l e f t V e r t f i g h t V e r t_{h}

where

C, c

are constants,

h

is the Gaussian function,

% 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

d o 0

. 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.

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)