Abstract
We present several examples to indicate the many possible numerical applications of the fast Fourier transform (FFT). It is widely used in signal processing for spectral analysis and for computing convolutions. We will see other important uses in computations involving high-degree polynomials and in interpolation problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gasquet, C., Witomski, P. (1999). Using the FFT for Numerical Computations. In: Fourier Analysis and Applications. Texts in Applied Mathematics, vol 30. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1598-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1598-1_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7211-3
Online ISBN: 978-1-4612-1598-1
eBook Packages: Springer Book Archive