Français
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.
...
The Ultimate Scientific and Technical Reference
A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects
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
Ongoing reading
Transformations for numerical methods
Transformations for numerical methods
Continuous functional transformations
References
General bibliography for applications of functional transformations
The Ultimate Scientific and Technical Reference
A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects
