A Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group the

Fractional Fourier transform computing, Mainly for data analysis and statistics, Including regression analysis and probability and statistics.