A Faber Series Approach to Cardinal Interpolation

For a compactly supported function <p in Rd we study quasiinterpolants based on point evaluations at the integer lattice. We restrict ourselves to the case where the coefficient sequence Xf, for given data /, is computed by applying a univariate polynomial q to the sequence <p\Zd , and then convolving with the data f\Z(¡ . Such operators appear in the well-known Neumann series formulation of quasi-interpolation. A criterion for the polynomial q is given such that the corresponding operator defines a quasi-interpolant. Since our main application is cardinal interpolation, which is well defined if the symbol of tp does not vanish, we choose q as the partial sum of a certain Faber series. This series can be computed recursively. By this approach, we avoid the restriction that the range of the symbol of <p must be contained in a disk of the complex plane excluding the origin, which is necessary for convergence of the Neumann series. Furthermore, for symmetric ¡p , we prove that the rate of convergence to the cardinal interpolant is superior to the one obtainable from the Neumann series.