| 1 |
We start by motivating the FFT (Fast Fourier Transform) as a solver for Poisson's equation
|
| 2 |
The we discuss sequential 1D discrete FFT in both DIF (Decimation in Frequency) and DIT (Decimation in Time) modes
|
| 3 |
We describe general N=N1*N2 case but soon specialize to binary (Cooley Tukey) FFT.
|
| 4 |
For binary case, we go through parallelism and use of cache giving a performance analysis
|
| 5 |
These lectures motivate later lectures on Fast Multipole method as general Green's function solver which is more flexible than FFT
|
