suivant: Inverse Fast Fourier Transform
monter: Fourier transformation
précédent: Applications
Table des matières
Index
Fast Fourier Transform : fft
fft takes as argument a list (or a sequence)
where N is a power of two.
fft returns the list
such that,
for k=0..N-1
where
is a primitive N-th root of the unity.
Input :
fft(0,1,1,0)
Output :
[2.0, -1-i, 0.0, -1+i]
giac documentation written by Renée De Graeve and Bernard Parisse