Shepard's method is a well-known technique for interpolating large sets of scattered data. The classical Shepard operator reconstructs an unknown function as a normalized blend of the function values at the scattered points, using the inverse distances to the scattered points as weight functions. Based on the general idea of defining interpolants by convex combinations, Little suggests to extend the bivariate Shepard operator in two ways. On the one hand, he considers a triangulation of the scattered points and substitutes function values with linear polynomials which locally interpolate the given data at the vertices of each triangle. On the other hand, he modifies the classical point-based weight functions and defines instead a normalized blend of the locally interpolating polynomials with triangle-based weight functions which depend on the product of inverse distances to the three vertices of the corresponding triangle. The resulting triangular Shepard operator interpolates all data required for its definition and reproduces polynomials up to degree 1, whereas the classical Shepard operator reproduces only constants. In this paper we show that this interpolation operator consequentially has quadratic approximation order, which is confirmed by our numerical results.
Abstract. We introduce the Shepard-Bernoulli operator as a combination of the Shepard operator with a new univariate interpolation operator: the generalized Taylor polynomial. Some properties and the rate of convergence of the new combined operator are studied and compared with those given for classical combined Shepard operators. An application to the interpolation of discrete solutions of initial value problems is given.
The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge phenomenon, also when the function to be interpolated is analytic. Among all techniques that have been proposed to defeat this phenomenon, there is the mock-Chebyshev interpolation which is an interpolation made on a subset of the given nodes whose elements mimic as well as possible the Chebyshev-Lobatto points. In this work we use the simultaneous approximation theory to combine the previous technique with a polynomial regression in order to increase the accuracy of the approximation of a given analytic function. We give indications on how to select the degree of the simultaneous regression in order to obtain polynomial approximant good in the uniform norm and provide a sufficient condition to improve, in that norm, the accuracy of the mock-Chebyshev interpolation with a simultaneous regression. Numerical results are provided.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.