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...
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Transformations for numerical methods
Continuous functional transformations
References
General bibliography for applications of functional transformations
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Article included in this offer
"Mathematics"
(
168 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
