MATRIX METHODS AND

CALCULUS
Lecture-2 UNIT - III
Fourier Series

Dr. Santhosh Nallapu

Assistant professor of Mathematics
Department of Science and Humanities
Sreenidhi Institute of Science and Technology
Yamnampet, Ghatkesar
1
We discussed the following
in previous Lecture:

1.Convergence of Sequence & Series

(Definitions)
We discuss the following in
today’s Lecture:

1.Definition of Fourier series

 Introduction
Fourier series introduced in 1807 by Fourier (after work
by Euler and Daniel Bernoulli) was one of the most
important developments in applied mathematics. It is
very useful in the study of heat conduction, mechanics,
concentrations of chemicals and pollutants, electrostatics,
acoustics and in areas unheard of in Fourier’s day such
as computing and CAT scan (computer assisted
tomography).

Fourier* series is an infinite series representation of

periodic function in terms of the trigonometric sine and
cosine functions. Fourier series is very powerful method 4
 Introduction
to solve ordinary and partial differential equations
particularly with periodic functions appearing as non-
homogeneous terms. While Taylor’s series expansion is
valid only for functions which are continuous and
differentiable, Fourier series is possible not only for
continuous functions but for periodic functions,
functions discontinuous in their values and derivatives.
Further, because of the periodic nature, Fourier series
constructed for one period is valid for all values.
Harmonic analysis is the theory of expanding functions
in Fourier series.
5
 PERIODIC FUNCTIONS
What is Fourier Series?
◦Representation of a periodic function with a
weighted, infinite sum of sinusoids.

Why Fourier Series?

◦Any arbitrary periodic signal, can be approximated
by using some of the computed weights
◦These weights are generally easier to manipulate
and analyze than the original signal

6
PERIODIC FUNCTIONS

To To

7
 PERIODIC FUNCTIONS

1
f ( x )  a0  a1 cos x  a2 cos 2 x  a3 cos 3 x  ...
2
 b1 sin x  b2 sin 2 x  b3 sin 3 x  ...
 
1
or f ( x )  a0   an cos nx   bn sin nx
2 n 1 n 1
is called a trigonometric series, where the constants
a0 , a1, a2 , a3 ..., b1 , b 2 , b3 ...are its coefficients.
8
 Fourier Series


1   n x   n x  
f ( x )  a0    an cos    bn sin  
2 n 1   L   L 
where the fourier co-efficient a 0 , a n , b n are
 2 L
1
a0 
L  f ( x )dx

 2 L
1  n x 
an 
L  f ( x ) cos 
 L 
 dx

 2 L
1  n x 
bn 
L  f ( x ) sin 
 L 
 dx

The constants a 0 , a n and b n (n = 1, 2, 3, ...) are
called Fouier coefficients. 9
 Fourier Series


1   n x   n x  
f ( x )  a0    an cos    bn sin  
2 n 1   L   L 
where the fourier co-efficient a 0 , a n , b n are
2L
1
a0 
L  f ( x)dx
0
2L
1  n x 
an 
L  f ( x ) cos 
 L 
 dx
0
2L
1  n x 
bn 
L  f ( x ) sin 
 L 
 dx
0
The constants a 0 , a n and b n (n = 1, 2, 3, ...) are
called Fouier coefficients. 10
 Fourier Series


1
f ( x )  a0   an cos nx  bn sin nx 
2 n 1
where the fourier co-efficient a 0 , a n , b n are
2
1
a0 
  f ( x)dx
0
2
1
an 
  f ( x) cos nxdx
0
2
1
bn 
  f ( x) sin nxdx
0
The constants a 0 , a n and b n (n = 1, 2, 3, ...) are
called Fouier coefficients. 11
 Fourier Series


1   n x   n x  
f ( x )  a0    an cos    bn sin  
2 n 1   L   L 
where the fourier co-efficient a 0 , a n , b n are
L
1
a0   f ( x )dx
LL
L
1  n x 
an   f ( x ) cos   dx
LL  L 
L
1  n x 
bn   f ( x ) sin   dx
LL  L 
The constants a 0 , a n and b n (n = 1, 2, 3, ...) are
called Fouier coefficients. 12
 Fourier Series


1
f ( x )  a0   an cos nx  bn sin nx 
2 n 1
where the fourier co-efficient a 0 , a n , b n are

1
a0 
  f ( x)dx


1
an 
  f ( x) cos nxdx


1
bn 
  f ( x) sin nxdx

The constants a 0 , a n and b n (n = 1, 2, 3, ...) are
called Fouier coefficients. 13
 Fourier Series

 a
a
 2 f ( x ) dx , if f ( x ) is even function
 f ( x ) dx  0

a 
0 if f ( x ) is odd function

14
 Fourier Series


1  n x 
f ( x )  a0   an cos  
2 n 1   
where the fourier co-efficient a 0 , a n are

2
a0 
 f ( x)dx
0

2  n x 
an  f ( x ) cos   dx
 0   
15
 Fourier Series


 n x 
f ( x )  bn sin  
n 1   
where the fourier co-efficient bn is

2  n x 
bn  f ( x ) sin   dx
 0   

16
 Fourier Series


1
f ( x )  a0   an cos nx 
2 n 1
where the fourier co-efficient a 0 , a n are

2
a0 
 f ( x)dx
0

2
an 
 f ( x) cos nx dx
0

17
 Fourier Series


f ( x )  bn sin nx 
n 1
where the fourier co-efficient bn is

2
bn  f ( x )sin nx dx
 0

18
19
DIRICHLET’S CONDITIONS

20
 DIRICHLET’S CONDITIONS
i. f(x) is periodic, single-valued and finite.
ii. f(x) has a finite number of discontinuities in any
one period .
iii. f(x) has at the most a finite number of maxima and
minima.
These conditions are called Dirichlet’s conditions.

NOTE: The above conditions are sufficient but not

necessary to have the Fourier series of f(x).
But if f(x) satisfies Dirichlet conditions then the
Fourier series of f(x) converges.
21
 DIRICHLET’S CONDITIONS
Convergence :
1. If f(x) is continuous at x = c ϵ (a, b) then the Fourier
series of f(x) at x = c convergence to f(c).
2. f(x) is discontinuous at x = c ϵ (a, b) then the Fourier
series of f(x) at x = c convergence to ½ [f(c-) + f(c+)]
3. The Fourier series of f(x) at the end points i.e. at x =
a or b converges to ½ [f(a+) + f(b-)]
Note: (i) Almost all the functions which occur in the
engineering problems satisfy these conditions and
hence, can be expressed as a Fourier series.
Note: (ii) Basically, the expansion of any function f(x)
as a Fourier series depends upon the evaluation of 22

the
DIRICHLET’S CONDITIONS

23
 THANK YOU

01/06/25
Feed Back to [email protected]