An algorithm based on the FFT for a generalized Chebyshev interpolation

Abstract

An algorithm for a generalized Chebyshev interpolation procedure, increasing the number of sample points more moderately than doubling, is presented. The FFT for a real sequence is incorporated into the algorithm to enhance its efficiency. Numerical comparison with other existing algorithms is given.