Fourier series are used to approximate non-periodic functions by a linear combination of periodic functions. In practice, more and more harmonics are added up until a shape sufficiently close to that of the original non-periodic function is obtained.
series | formula | used for | |
---|---|---|---|
Fourier sine series | odd functions: f(-x)=-f(x) | ||
Fourier cosine series | even functions: f(-x)=f(x) | ||
complex Fourier series | functions with other or no symmetry |
Assume we have a non-periodic function, | : | . |
We can think of this as a section of an odd periodic function, | : | . |
Within the limits in which f(x) is defined, f(x)=g(x), so it doesn't matter what we add outside the limits.
The coefficients of the sine series, | , |
are found by solving the integral | , |
where l is half the period of the fundamental (n=1) oscillation. | |
Insert f(x) and l: | , |
integrate: | , |
and substitute the limits: | . |
Hence, f(x) can be expressed as: |
The image on the right shows the first five odd terms (n=1,3,5,7,9) and how they gradually build up the shape of the top-hat function. The Fourier coefficients of the even terms are zero as shown above; therefore they aren't shown. The individual Fourier terms are plotted in green and their sum in blue. Note that the amplitude of each term is smaller than that of its predecessor, i.e. the corrections are getting smaller each time.
Equipped with the Fourier series, we can generalise the concept and move on to the Fourier transform.