Dear All,
Hope you are fine and doing well in this pandemic.
I am working on a FORTRAN program, where I need to sum the Gaussian functions over time. I have observed that my computing time is scaling linearly with the number of iterations. I found FFT is useful for such tasks while reading about techniques to reduce the iterations. So, my question is if FFT can efficient for my task, how can I implement it?.
Pseudocode or suggestions are appreciated.
Cheers!
Anji
Dear Anji BABU Kapakayala ,
did you read "Five-step FFT algorithm with reduced computational complexity", please see the follwoing link, may be it will help you.
Article Five-step FFT algorithm with reduced computational complexity
One relatively older open implementation of FFT algorithms is here:
www.fftw.org
The routines can be called from both C and FORTRAN.
- Badges
- Science topic