summaryrefslogtreecommitdiffstats
path: root/Fourier Series.page
blob: cbda2c8b39e39ea004e7530715a1e31f518ad3bf (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
<b>Lecture on Fourier Series:</b>  
  
##Why Fourier series possible?</b>

We first begin with a few basic identities on the size of sets. Show that the set of possible functions representing sets is not larger than the set of available functions?

##Why Fourier series is plausible?</b>
To show that Fourier series is plausible, let us consider some arbitrary trignometric functions and see if it is possible to express them as the sum of sines and cosines:  
 $1.  \cos(2x) = 1 - 2 \sin^2(x)$
\therefore \sin^2(x) = 1/2 - \cos(2x)/2

  
##What is the Fourier series actually?</b>

##Why is Fourier series useful? </b>

$(\nearrow)\cdot(\uparrow)=(\nwarrow)$