Abstract
The Fourier transform is one of the main tools of analysis with a large number of important applications in physics, technology and statistics. In numerical applications it has to appear in discrete form as the finite Fourier transform. This transform is associated with the theory of characters of finite modules (abelian groups) which forms the first part of this chapter. The remaining parts are devoted to applications, first a proof of the quadratic reciprocity theorem and then numerical applications, in particular the method of computing the finite Fourier transform which is called the fast Fourier transform, FFT.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Gårding, L., Tambour, T. (1988). The finite Fourier transform. In: Algebra for Computer Science. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8797-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8797-8_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96780-6
Online ISBN: 978-1-4613-8797-8
eBook Packages: Springer Book Archive