Fast Fourier Transform (FFT)
| Date written: | |
| Authors: | |
| Resource type: | article |
| Links: | The article in .pdf format |
Description
This is in fact chapter 12.2 in Numerical Recipes. This chapter describes the FFT algorithm and gives an example implementation of it. It also mentions briefly how the FFT algorithm can be implemented to run more efficiently.
DB information
| Date created: | 0000-00-00 00:00:00 |
| Date evaluated: | 0000-00-00 00:00:00 |
| Categories: | Mathematics/Fourier transform |