About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Approximation Theory
Paper
On quasi-interpolation with radial basis functions
Abstract
It has been known since 1987 that quasi-interpolation with radial functions on the integer grid can be exact for certain order polynomials. If, however, we require that the basis functions of the quasi-interpolants be finite linear combinations of translates of the radial functions, then this can be done only in spaces whose dimension has a prescribed parity. In this paper we show how infinite linear combinations of translates of a given radial function can be found that provide polynomial exactness in spaces whose dimensions do not have this prescribed parity. These infinite linear combinations are of a simple form. They are, in particular, easier to find than the cardinal functions of radial basis function interpolation, which provide polynomial exactness in all dimensions. The techniques that are used in this work also give rise to some remarks about interpolation with radial functions both on the integers and on the nonnegative integers. © 1993 Academic Press, Inc.