A rescaled method for RBF approximation

In the recent paper [8], a new method to compute stable kernel-based interpolants has been presented. This \textit{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

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\u2019s 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

Approximation Theory XV: San Antonio 2016

These proceedings are based on papers presented at the international conference Approximation Theory XV, which was held May 22\u201325, 2016 in San Antonio, Texas. The conference was the fifteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 146 participants. The book contains longer survey papers by some of the invited speakers covering topics such as compressive sensing, isogeometric analysis, and scaling limits of polynomials and entire functions of exponential type. The book also includes papers on a variety of current topics in Approximation Theory drawn from areas such as advances in kernel approximation with applications, approximation theory and algebraic geometry, multivariate splines for applications, practical function approximation, approximation of PDEs, wavelets and framelets with applications, approximation theory in signal processing, compressive sensing, rational interpolation, spline approximation in isogeometric analysis, approximation of fractional differential equations, numerical integration formulas, and trigonometric polynomial approximation

Partition of unity interpolation using stable kernel-based techniques

In this paper we propose a new stable and accurate approximation technique which is extremely effective for interpolating large scattered data sets. The Partition of Unity (PU) method is performed considering Radial Basis Functions (RBFs) as local approximants and using locally supported weights. In particular, the approach consists in computing, for each PU subdomain, a stable basis. Such technique, taking advantage of the local scheme, leads to a significant benefit in terms of stability, especially for flat kernels. Furthermore, an optimized searching procedure is applied to build the local stable bases, thus rendering the method more efficient