A rescaled method for RBF approximation

A new method to compute stable kernel-based interpolants has been presented by the second and third authors. This rescaled interpolation method combines the standard kernel interpolation with a properly defined rescaling operation, which smooths the oscillations of the interpolant. Although promising, this procedure lacks a systematic theoretical investigation. Through our analysis, this novel method can be understood as standard kernel interpolation by means of a properly rescaled kernel. This point of view allow us to consider its error and stability properties. First, we prove that the method is an instance of the Shepard’s method, when certain weight functions are used. In particular, the method can reproduce constant functions. Second, it is possible to define a modified set of cardinal functions strictly related to the ones of the not-rescaled kernel. Through these functions, we define a Lebesgue function for the rescaled interpolation process, and study its maximum - the Lebesgue constant - in different settings. Also, a preliminary theoretical result on the estimation of the interpolation error is presented. As an application, we couple our method with a partition of unity algorithm. This setting seems to be the most promising, and we illustrate its behavior with some experiments.