A formula for the error of finite sinc interpolation with an even number of nodes

Authors:
Jean-Paul Berrut
Affiliations:
Department of Mathematics, University of Fribourg, Fribourg, Switzerland 1700
Venue:
Numerical Algorithms
Year:
2011

Citing 6
Cited 2

Numerical analysis: mathematics of scientific computing

Numerical analysis: mathematics of scientific computing
Sinc methods for quadrature and differential equations

Sinc methods for quadrature and differential equations
Sampling theory for not necessarily band-limited functions: a historical overview

SIAM Review
First applications of a formula for the error of finite sinc interpolation

Numerische Mathematik
A circular interpretation of the Euler-Maclaurin formula

Journal of Computational and Applied Mathematics
A formula for the error of finite sinc interpolation with an even number of nodes

Numerical Algorithms

A formula for the error of finite sinc interpolation with an even number of nodes

Numerical Algorithms
A note on the alternate trapezoidal quadrature method for Fredholm integral eigenvalue problems

Numerical Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sinc interpolation is a very efficient infinitely differentiable approximation scheme from equidistant data on the infinite line. We give a formula for the error committed when the function neither decreases rapidly nor is periodic, so that the sinc series must be truncated for practical purposes. To do so, we first complete a previous result for an odd number of points, before deriving a formula for the more involved case of an even number of points.