4 FOURIER TRANSFORM

SYLLABUS Previous: Finite elements Up: Contents Next: 4.1 FFT with the

4 FOURIER TRANSFORM

As mentioned earlier in sect.1.4, it is largely thanks to the possibility of computing efficiently the Fourier transformation with $\mathcal{O}(N\log N)$ operations that fast Fourier transforms (FFT) can be considered as a viable alternative to solve partial differential equations.

4.1 FFT with the computer
4.2 Linear equations.
4.3 Aliasing, filters and convolution.
4.4 Non-linear equations.
4.5 Computer quiz
4.6 Exercises
4.7 Further Reading
4.8 Interactive evaluation form