![](/assets/images/picto-drapeau-france-3a76576a5d60a512053b4612ab58dae5.png)
3. Transformations for numerical methods
3.1 Discrete Fourier transforms and fast Fourier transforms
3.1.1 Definition of the discrete Fourier transform
Given a complex 2 π-periodic function, f, we defined the sequence S n by (7) with the change of notation n for N, and with here the variable x instead of t.
...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference
This article is included in
Mathematics
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Transformations for numerical methods
References
General bibliography for applications of functional transformations
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference