Calc 2 Lecture Notes

Section 8.9

Page 1 of 2

Section 8.9: Fourier Series Big idea: Functions can also be written as an infinite sum of sine and cosine terms (called a Fourier series), instead of an infinite sum of power terms (i.e., our old friend the Taylor series). Fourier series are ideal for representing functions that oscillate, or repeat over their domain. Big skill: You should be able to obtain the Fourier series representation of a given function. Fourier Series: a f ( x) = 0 + ak cos ( kx ) + bk sin ( kx ) 2 k =1 Introductory Example: Fourier Series for a Square Wave Function 0 if < x 0 1. First, assume the square wave function f ( x ) = can be represented 1 if 0 < x with a Fourier series: a f ( x) = 0 + ak cos ( kx ) + bk sin ( kx ) 2 k =1 a f ( x ) = 0 + ( a1 cos ( x ) + b1 sin ( x ) ) + ( a2 cos ( 2 x ) + b2 sin ( 2 x ) ) + ( a3 cos ( 3x ) + b3 sin ( 3 x ) ) + ... 2 2. Notice that if we integrate both sides from - to , then only the coefficient a0 remains:

3. Insight: To calculate a1, multiply both sides of the equation by cos(x), then integrate both sides from - to once again:

Calc 2 Lecture Notes

Section 8.9

Page 2 of 2

4. Insight: To calculate b1, multiply both sides of the equation by sin(x), then integrate both sides from - to once again:

5. Repeat this pattern for all the higher coefficients:

Fourier Series: a f ( x) = 0 + ak cos ( kx ) + bk sin ( kx ) , 2 k =1 where 1 a0 = ak = 1

f ( x ) dx ,

f ( x ) cos ( kx ) dx ,

1 and bk = f ( x ) sin ( kx ) dx .