Implement F-DST to solve 2-D PDE(fast poisson solver) and FFT to compute Multiplication algorithm(Schönhage–Strassen algorithm) with C
-
Updated
Feb 8, 2017 - C++
Implement F-DST to solve 2-D PDE(fast poisson solver) and FFT to compute Multiplication algorithm(Schönhage–Strassen algorithm) with C
Implement Cooley–Tukey FFT algorithm with C
Python Code to find the output of each stage of 8 point butterfly of DFT and IDFT
Add a description, image, and links to the butterfly-structures topic page so that developers can more easily learn about it.
To associate your repository with the butterfly-structures topic, visit your repo's landing page and select "manage topics."