We present a simple, original method to improve piecewise linear interpolation with uniform knots: We shift the sampling knots by a fixed amount, while enforcing the interpolation property. Thanks to a theoretical analysis, we determine the optimal shift that maximizes the quality of our shifted linear interpolation. Surprisingly enough, this optimal value is nonzero and it is close to 1/5. We ...

In this paper, an interpolation method for solving linear diierential equations was developed using multiquadric scheme. Unlike most iterative formula , this method provides a global interpolation formulae for the solution. Numerical examples show that this method ooers a higher degree of accuracy than Runge-Kutta formula and the iterative multistep methods developed by Hyman (1978).

In a similar fashion to estimates shown for Harmonic, Wachspress, and Sibson coordinates in [Gillette et al., AiCM, to appear], we prove interpolation error estimates for the mean value coordinates on convex polygons suitable for standard finite element analysis. Our analysis is based on providing a uniform bound on the gradient of the mean value functions for all convex polygons of diameter on...

Theorem 3.2 A consequence system (L,`) enjoys Craig interpolation with respect to an L-function var, if (i) there is a Craig generalized translation schema from (L,`) to another consequence system (L′,`′) with respect to var and an L′-function var′; (ii) (L′,`′) enjoys Craig interpolation with respect to var′. Proof: Let (h1, h2, h) be a Craig generalized translation schema from (L,`) to (L′,`′...

Abstraction, counterexample-guided refinement, and interpolation are techniques that are essential to the success of predicate-based program analysis. These techniques have not yet been applied together to explicit-value program analysis. We present an approach that integrates abstraction and interpolation-based refinement into an explicit-value analysis, i.e., a program analysis that tracks ex...

Scattered data interpolation using Radial Basis Functions (RBFs) involves solving ill-conditioned Symmetric Positive Definite (SPD) linear systems; refer e.g. to [6] for further details. We will discuss the properties (conditioning, density) of the interpolation matrices for both global and compactly supported kernels, depending on the value of the shape parameter for both classical global inte...