| 释义 |
Fast Fourier Transform
fast Fourier transform[¦fast ‚fu̇r·ē‚ā ′tranz‚fȯrm] (mathematics) A Fourier transform employing the Cooley-Tukey algorithm to reduce the number of operations. Abbreviated FFT. Fast Fourier Transform (algorithm)(FFT) An algorithm for computing the Fourier transform of a set of discrete data values. Given a finiteset of data points, for example a periodic sampling taken froma real-world signal, the FFT expresses the data in terms ofits component frequencies. It also solves the essentiallyidentical inverse problem of reconstructing a signal from thefrequency data.
The FFT is a mainstay of numerical analysis. Gilbert Strangdescribed it as "the most important algorithm of ourgeneration". The FFT also provides the asymptotically fastestknown algorithm for multiplying two polynomials.
Versions of the algorithm (in C and Fortran) can be foundon-line from the GAMS server here.
["Numerical Methods and Analysis", Buchanan and Turner].fast Fourier transform
fast Fourier transform An MRI term for a very fast and efficient computational method of performing a Fourier transform—the mathematical process by which raw data is processed into a usable image.AcronymsSeefood for thought |