Ayush Baranwal
ffcaef924a
Addresses #707 Implements the Radix-2 Cooley-Tukey Fast Fourier Transform (FFT) algorithm to compute the discrete fourier transform and inverse discrete fourier transform of a signal. Inputs are currently restricted to lengths of powers of 2.
13 lines
155 B
ReStructuredText
13 lines
155 B
ReStructuredText
Fast Fourier Transform
|
|
----------------------------------
|
|
|
|
FFT
|
|
...
|
|
|
|
.. autofunction:: mpmath.fft
|
|
|
|
|
|
Inverse FFT
|
|
...........
|
|
|
|
.. autofunction:: mpmath.invfft |