Fourier series
NB. Fourier series are periodic
Euler's formula
include complex number
Gibbs Phenomena: For the discrete point of the function, the fourier approximation is oscillating Since we truncate the formula by define the K. If K goes infinite, then the oscillation goes away
If K >= n/2, them the phenomena is derived. Because the plot we made is actually a bunch of points. So keep K the same, if we double n, then the Gibbs Phen. comes back.
Fourier transform Approximate a function without periodicity
Which is:
Fourier transform and derivatives
require: (which is a restriction for fourier transform)
Then:
FT and convolution\
What is convolution?
So
Parseval's Theorem
FT for PDE (an example)
heat_equation
FT:
ODE
Then:
Gaussian
Discrete Fourier Transform
Fast Fourier Transform
Laplace transform

Some functions are badly represented using fourier transform, e.g. 



