Interpolation using the fast Fourier transform

The fast Fourier transform (FFT) algorithm has had widespread influence in many areas of computation since its "rediscovery" by Cooley and Tukey [1]. An efficient and accurate method for interpolation of functions based on the FFT is presented. As an application, the generation of the characteristic polynomial in the "generalized eigenvalue problem" [2] is considered.