DocumentCode :
925081
Title :
Interpolation using the fast Fourier transform
Author :
Singhal, Kishore ; Vlach, Jiri
Author_Institution :
Univ. Waterloo, Waterloo, Ont., Canada
Volume :
60
Issue :
12
fYear :
1972
Firstpage :
1558
Lastpage :
1558
Abstract :
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.
Keywords :
Arithmetic; Councils; Eigenvalues and eigenfunctions; Equations; Fast Fourier transforms; Frequency; Interpolation; Lagrangian functions; Polynomials; Taylor series;
fLanguage :
English
Journal_Title :
Proceedings of the IEEE
Publisher :
ieee
ISSN :
0018-9219
Type :
jour
DOI :
10.1109/PROC.1972.8958
Filename :
1450888
Link To Document :
بازگشت