KARNATAK LAW SOCIETY’S

GOGTE INSTITUTE OF TECHNOLOGY

UDYAMBAG, BELAGAVI-590008
(An Autonomous Institution under Visveswaraya Technological
University, Belagavi)
(APPROVED BY AICTE, NEW DELHI)
Department of Information Science and Engineering

Course Activity Report on

Fourier Series Representation
Submitted in the partial fulfilment for the academic requirement of
3rd Semester B.E
In
MATHEMATICS

Submitted by
NAME USN
Karan M kamble 2GI18CV032
Rakesh Pujari 2GI18CV060
2020-2021

CONTENT
1. Introduction

2. Problem definition

3. History

4. Explanation

5. Conclusion

6. References

Signature of Staff

1. INTRODUCTION
 What is Fourier series?

Fourier series are very important to engineers for representing period

functions and they can be expanded to Fourier transforms for representing aperiodic
signals as well. The purpose of this project is to help better visualize the Fourier
representation of a few common signals.
In this project, a Fourier series representation of a given function will be
found. This series will then be plotted along with the actual function and the error
quantified. By increasing the number of terms, the series representation will start to
close match the actual function.

As we know that TAYLOR SERIES representation of function is valid only

for those functions which are continuous and differentiable. But there are many
discontinuous periodic functions which requires to express in terms of an infinite
series containing sine and cosine terms.
FOURIER SERIES, which is an infinite series representation of such
functions in terms of ‘sine’ and ‘cosine’ terms, is useful here. Thus, FOURIER
SERIES, are in certain since, more UNIVERSAL than TAYLOR’S SERIES as it
applies to all continuous, periodic functions and also to the function which are
discontinuous in their values and derivatives. Fourier series a very powerful method
to solve ordinary and partial differential equation, particularly with periodic functions
appearing as non-homogenous terms.

2. PROBLEM DEFINITION

Find the Fourier series representation of f(x)=𝑠𝑖𝑛2 𝑥 + 𝑐𝑜𝑠 2 𝑥 in (−𝜋, 𝜋).

Compare the result with trigonometric formula.
 3. HISTROY

The Fourier series is named in honour of Jean-Baptiste Joseph

Fourier (1768–1830), who made important contributions to the study of trigonometric
series, after preliminary investigations by Leonhard Euler, Jean le Rond d'Alembert,
and Daniel Bernoulli. Fourier introduced the series for the purpose of solving
the heat equation in a metal plate, publishing his initial results in his 1807 Mémoire
sur la propagation de la chaleur dans les corps solides (Treatise on the propagation
of heat in solid bodies), and publishing his Théorie analytique de la
chaleur (Analytical theory of heat) in 1822. The Mémoire introduced Fourier analysis,
specifically Fourier series. Through Fourier's research the fact was established that
an arbitrary (at first, continuous and later generalized to any piecewise-smooth
function] can be represented by a trigonometric series. The first announcement of
this great discovery was made by Fourier in 1807, before the French Academy. Early
ideas of decomposing a periodic function into the sum of simple oscillating functions
date back to the 3rd century BC, when ancient astronomers proposed an empiric
model of planetary motions, based on deferents and epicycles.
From a modern point of view, Fourier's results are somewhat informal, due to
the lack of a precise notion of function and integral in the early nineteenth century.
Later, Peter Gustav Lejeune Dirichlet and Bernhard Riemann expressed Fourier's
results with greater precision and formality.
Although the original motivation was to solve the heat equation, it later became
obvious that the same techniques could be applied to a wide array of mathematical
and physical problems, and especially those involving linear differential equations
with constant coefficients, for which the eigen solutions are sinusoids. The Fourier
series has many such applications in electrical engineering, vibration
analysis, acoustics, optics, signal processing, image processing, quantum
mechanics, econometrics, thin-walled shell theory, etc

4. EXPLINATION
DEFINTION:
Consider a real-valued function, f(X) that is integrable on an interval
of length , p which will be the period of the Fourier series. Common examples of
analysis intervals are:
x 𝝐 [0,1] and c = 1
x 𝝐 [ −𝜋, 𝜋] and c = 2𝜋
The analysis process determines the weights, indexed by integer 𝑛 , which is also
the number of cycles of the 𝑛𝑡ℎ harmonic in the analysis interval. Therefore, the
length of a cycle, in the units of x , is C/𝒏 . And the corresponding harmonic
𝑛 𝑛
frequency is 𝒏/C . The 𝑛𝑡ℎ harmonics are sin(2𝜋𝑥 𝑐 ) and cos(2𝜋𝑥 𝑐 ) , and their
amplitudes (weights) are found by integration over the interval of length c :
 Coefficients of Fourier series
𝟏 ∝+𝟐𝒄
1. 𝒂𝟎 = ∫∝ 𝒇(𝒙)𝒅𝒙
𝒄
𝟏 ∝+𝟐𝒄 𝑛
2. 𝒂𝒏 = ∫ 𝒇(𝒙) cos(𝜋𝑥 ) 𝒅𝒙
𝒄 ∝ 𝑐
𝟏 ∝+𝟐𝒄 𝑛
3. 𝒃𝒏 = ∫∝
𝒇(𝒙) sin(𝜋𝑥 ) 𝒅𝒙
𝒄 𝑐
 If f(x) is c-
periodic, then any interval of that length is sufficient.
 𝑎0 and 𝑏0 can be reduced to 𝒂𝟎 = ∫ 𝒇(𝒙)𝒅𝒙 and 𝒃𝟎 = 𝟎.
 Many texts choose C = 2𝜋 to simplify the argument of the sinusoid
functions.
The
sy
Fourier series sine-cosine form nth
esi
𝒂𝟎 𝑛 𝑛
𝒇(𝒙) = + ∑∞ ∞
𝒏=𝟏 𝒂𝒏 . cos(𝜋𝑥 )+ ∑𝒏=𝟏 𝒃𝒏 . sin(𝜋𝑥 )
s pr
𝟐 𝑐 𝑐 oce
Where n = 1,2,3, … ss
(the
act
ual Fourier series) is:

Graphical representation of Fourier series coefficients

 If s(t) is a function contained in an interval of length p (and zero elsewhere), the
upper-right quadrant is an example of what its Fourier series coefficients (𝑨𝒏 ) might
look like when plotted against their corresponding harmonic frequencies. The upper-
left quadrant is the corresponding Fourier transform of s(t) The Fourier series
summation (not shown) synthesizes a periodic summation of s(t) whereas the
inverse Fourier transform (not shown) synthesizes only s(t).

GENERAL PROPERTIES

 Table of basic properties

This table shows some mathematical operations in the time domain and the corresponding
effect in the Fourier series coefficients. Notation:

Frequency domain
Property Time domain
(exponential form)

Linearity 𝑎. 𝑓(𝑥) + 𝑏. 𝑔(𝑥) 𝑎. 𝐹[𝑛] + 𝑏. 𝐺[𝑛]

Time reversal / Frequency reversal 𝑓 (−𝑥) 𝐹[−𝑛]

Time conjugation 𝑓 (𝑥)∗ 𝐹[−𝑛]∗

Time reversal & conjugation 𝑓 (−𝑥)∗ 𝐹[𝑛]∗

1
Real part in time 𝑅𝑒(𝑓 (𝑥)) 2
(𝐹[𝑛] + 𝐹[−𝑛]∗ )

1
Imaginary part in time 𝐼𝑚(𝑓(𝑥)) (𝐹[𝑛] + 𝐹[−𝑛]∗ )
2𝑖

1
Real part in frequency 2
(𝑓(𝑥) + 𝑓(−𝑥)∗ ) 𝑅𝑒(𝐹[𝑛])

1
Imaginary part in frequency 2𝑖
(𝑓(𝑥) + 𝑓(−𝑥)∗ ) 𝐼𝑚(𝐹[𝑛])

Shift in time / Modulation in 2𝜋𝑥0

𝑓 (𝑥 − 𝑥0 ) 𝐹[𝑛]. 𝑒 −𝑖 𝑇
𝑛
frequency

Shift in frequency / Modulation in 2𝜋𝑥0

time 𝑓(𝑥). 𝑒 𝑖 𝑇
𝑛 𝐹[𝑛 − 𝑛0 ]

 𝓏 ∗ is the complex conjugate of 𝓏 .

 f(x), g(x) P-designate periodic functions defined on 0<x≤ 𝑃.
 F[n],G[n] designate the Fourier series coefficients (exponential form) of 𝑓 𝑎𝑛𝑑 𝑔 as defined
in equation

 Periodic property
EVEN FUNCTION
If function 𝑓 (𝑥 ) is an even periodic function with the period 2C(-C≤ 𝑋 ≤ 𝐶),
𝑛𝜋𝑥 𝑛𝜋𝑥
then 𝑓 (𝑥) cos( 𝐶 ) is even while 𝑓 (𝑥 ) sin( 𝐶 ) is odd.

Thus the Fourier series expansion of an even periodic function 𝑓 (𝑥 ) with period
2C(-C≤ 𝑋 ≤ 𝐶) is given by,
∞
𝒂𝟎 𝒏
𝒇(𝒙) = + ∑ 𝒂𝒏 . 𝐜𝐨𝐬(𝝅𝒙 )
𝟐 𝒄
𝒏=𝟏
Where,
𝟐 𝒄
1. 𝒂𝟎 = ∫𝟎 𝒇(𝒙)𝒅𝒙
𝒄
 𝟐 𝒄 𝒏
2. 𝒂𝒏 = ∫ 𝒇(𝒙) 𝐜𝐨𝐬(𝝅𝒙 𝒄 ) 𝒅𝒙
𝒄 𝟎
n=1,2,3, …
3. 𝒃𝒏 = 𝟎

ODD FUNCTION
If function 𝑓 (𝑥 ) is an even periodic function with the period 2C(-C≤ 𝑋 ≤
𝑛𝜋𝑥 𝑛𝜋𝑥
𝐶), then 𝑓 (𝑥 ) cos( 𝐶 ) is even while 𝑓(𝑥 ) sin( 𝐶 ) is odd.

Thus the Fourier series expansion of an odd periodic function 𝑓(𝑥) with period
2C(-C≤ 𝑋 ≤ 𝐶) is given by,
𝑛
𝒇(𝒙) = ∑∞
𝒏=𝟏 𝒃𝒏 . sin(𝜋𝑥 ) 𝑐

Where,
𝟐 𝒄 𝒏
𝟏. 𝒃𝒏 = ∫𝟎 𝒇(𝒙) 𝐬𝐢𝐧(𝝅𝒙 ) 𝒅𝒙 n=1,2,3, …
𝒄 𝒄

2. 𝒂𝟎 = 𝒂𝒏 = 𝟎

EXAMPLES
1. Find the Fourier series representation of f(x)=𝑠𝑖𝑛2 𝑥 + 𝑐𝑜𝑠 2 𝑥 in (−𝜋, 𝜋).
Compare the result with trigonometric formula.
Solution:
f(x)=𝑠𝑖𝑛2 𝑥 + 𝑐𝑜𝑠 2 𝑥 in (−𝜋, 𝜋)
(∝ , ∝ +2𝐶 ) = (−𝜋, 𝜋)
So,

∝ = −𝜋 And 𝐶= 𝜋

The Fourier
series
𝒂𝟎 𝒏 𝒏
𝒇(𝒙) = + ∑∞ ∞
𝒏=𝟏 𝒂𝒏 . 𝐜𝐨𝐬(𝝅𝒙 )+ ∑𝒏=𝟏 𝒃𝒏 . 𝐬𝐢𝐧(𝝅𝒙 )
representation,
𝟐 𝒄 𝒄
------eq.1

Let’s find, 𝒂𝟎 , 𝒂𝒏 & 𝒃𝒏

𝟏 ∝+𝟐𝑪
WKT, 𝒂𝟎 = ∫∝ 𝒇(𝒙)𝒅𝒙
𝒄
 1 𝜋
= 𝜋
∫−𝜋(𝑠𝑖𝑛2 𝑥 + 𝑐𝑜𝑠 2 𝑥) . 𝑑𝑥

1 𝜋
= ∫−𝜋 1 . 𝑑𝑥 ------ ∵ 𝑠𝑖𝑛2 𝑥 + 𝑐𝑜𝑠 2 𝑥 = 1
𝜋

1 𝜋
= [𝑥] −𝜋
𝜋

1
= [𝜋 − (−𝜋)]
𝜋

1
= × 2𝜋
𝜋

𝒂𝟎 = 𝟐

𝟏 ∝+𝟐𝒄 𝒏
𝒂𝒏 = ∫ 𝒇(𝒙) 𝐜𝐨𝐬(𝝅𝒙 ) 𝒅𝒙
𝒄 ∝ 𝒄

1 𝜋 𝑛
= 𝜋
∫−𝜋 (𝑠𝑖𝑛2 𝑥 + 𝑐𝑜𝑠 2 𝑥) . cos(𝜋𝑥 𝜋) . 𝑑𝑥
1 𝜋
=
𝜋
∫−𝜋 1 . cos(𝑛𝑥) . 𝑑𝑥
1 𝜋
= 𝜋
∫−𝜋 cos(𝑛𝑥) . 𝑑𝑥
1 sin(𝑛𝑥) 𝜋
= [ ] −𝜋
𝜋 𝑛
1 1 𝜋
= × [sin(𝑛𝑥)] −𝜋
𝜋 𝑛
1 1
= × 𝑛 [sin 𝑛𝜋 − sin(−𝑛𝜋)]
𝜋

𝒂𝒏 = 0
𝟏 ∝+𝟐𝒄 𝑛
𝒃𝒏 = ∫ 𝒇(𝒙) sin(𝜋𝑥 ) 𝒅𝒙
𝒄 ∝ 𝑐
1 𝜋 𝑛
= 𝜋
∫−𝜋(𝑠𝑖𝑛2 𝑥 + 𝑐𝑜𝑠 2 𝑥) . sin(𝜋𝑥 𝜋) . 𝑑𝑥
1 𝜋
= 𝜋
∫−𝜋 1 . sin(𝑛𝑥) . 𝑑𝑥
1 𝜋
= 𝜋
∫−𝜋 sin(𝑛𝑥) . 𝑑𝑥
1 −cos(𝑛𝑥) 𝜋
= [ ] −𝜋
𝜋 𝑛
1 1 𝜋
=− × 𝑛 [cos(𝑛𝑥)] −𝜋
𝜋
1 1
= − 𝜋 × 𝑛 [cos( 𝑛𝜋) − cos(−𝑛𝜋)]
1 1
= − 𝜋 × 𝑛 [0]
 𝒃𝒏 = 0
Put all values in the equation -- 1,
Then we get,
𝟐 𝒏 𝒏
𝒇(𝒙) = + ∑∞ ∞
𝒏=𝟏 𝟎 . 𝐜𝐨𝐬(𝝅𝒙 )+ ∑𝒏=𝟏 𝟎 . 𝐬𝐢𝐧(𝝅𝒙 )
𝟐 𝝅 𝝅

=1+0+0

𝒇(𝒙) = 1

Verification:
trigonometric formula

𝑠𝑖𝑛2 𝑥 + 𝑐𝑜𝑠 2 𝑥 = 1
Which is similar to our final answer.

EXAMPLE 2
Find the Fourier series for the square 2π-periodic wave defined on the interval [−π, π]:
𝟎, 𝐢𝐟 − 𝛑 ≤ 𝐱 ≤ 𝟎
f(x) = {
1, 𝑖𝑓 0 < 𝐱 ≤ 𝛑

Solution:
(∝ , ∝ +2𝐶 ) = (−𝜋, 𝜋)
So,

∝ = −𝜋 And 𝐶= 𝜋

The Fourier
series
𝒂𝟎 𝒏 𝒏
𝒇(𝒙) = + ∑∞ ∞
𝒏=𝟏 𝒂𝒏 . 𝐜𝐨𝐬(𝝅𝒙 )+ ∑𝒏=𝟏 𝒃𝒏 . 𝐬𝐢𝐧(𝝅𝒙 )
representation,
𝟐 𝒄 𝒄
------eq.1

First, we calculate the constant 𝒂𝟎 :

𝟏 ∝+𝟐𝑪
𝒂𝟎 = ∫∝ 𝒇(𝒙)𝒅𝒙
𝒄
 1 𝜋
𝒂𝟎 = ∫−𝜋 𝑓(𝑥). 𝑑𝑥
𝜋

1 𝜋
= 𝜋
∫0 1 . 𝑑𝑥

1
= [𝑥] 𝜋0
𝜋

1
= [𝜋 − (0)]
𝜋

1
= ×𝜋
𝜋

𝒂𝟎 = 𝟏
𝟏 ∝+𝟐𝒄 𝒏
𝒂𝒏 = ∫ 𝒇(𝒙) 𝐜𝐨𝐬(𝝅𝒙 ) 𝒅𝒙
𝒄 ∝ 𝒄

1 𝜋 𝑛
= 𝜋
∫−𝜋 𝑓(𝑥) . cos(𝜋𝑥 𝜋) . 𝑑𝑥
1 𝜋
= 𝜋
∫0 1 . cos(𝑛𝑥) . 𝑑𝑥
1 𝜋
= 𝜋
∫0 cos(𝑛𝑥) . 𝑑𝑥
1 sin(𝑛𝑥) 𝜋
= [ ]0
𝜋 𝑛
1 1
= × 𝑛 [sin(𝑛𝑥)] 𝜋0
𝜋
1 1
= × 𝑛 [sin 𝑛𝜋 − sin(0)]
𝜋

𝒂𝒏 = 0
𝟏 ∝+𝟐𝒄 𝑛
𝒃𝒏 = ∫ 𝒇(𝒙) sin(𝜋𝑥 ) 𝒅𝒙
𝒄 ∝ 𝑐
1 𝜋 𝑛
= 𝜋
∫−𝜋 𝑓(𝑥) . sin(𝜋𝑥 𝜋) . 𝑑𝑥
1 𝜋
= 𝜋
∫0 1 . sin(𝑛𝑥) . 𝑑𝑥
1 𝜋
= 𝜋
∫0 sin(𝑛𝑥) . 𝑑𝑥
1 −cos(𝑛𝑥) 𝜋
= [ ]0
𝜋 𝑛
1 1
=− × 𝑛 [cos(𝑛𝑥)] 𝜋0
𝜋
1 1
=− 𝜋 × 𝑛 [cos( 𝑛𝜋) − cos(0)]
1− cos 𝑛𝜋
= 𝑛
 As we know that cos 𝑛𝜋 = (−1)𝑛 so,
𝟏−(−𝟏)𝒏
𝒃𝒏 =
𝒏𝝅

Put all values in the equation -- 1,

Then we get,
𝟏 𝒏 𝟏−(−𝟏)𝒏 𝒏
𝒇(𝒙) = + ∑∞ ∞
𝒏=𝟏 𝟎 . 𝐜𝐨𝐬(𝝅𝒙 ) + ∑𝒏=𝟏 . 𝐬𝐢𝐧(𝝅𝒙 )
𝟐 𝝅 𝒏𝝅 𝝅

𝟏 𝟏−(−𝟏)𝒏
𝒇(𝒙) = + ∑∞
𝒏=𝟏 . 𝐬𝐢𝐧(𝒏𝒙)
𝟐 𝒏𝝅

𝟏 𝟏−(−𝟏)𝒏
𝒇(𝒙) = + ∑∞
𝒏=𝟏 . 𝐬𝐢𝐧(𝒏𝒙) where n = 1, 2, 3, …
𝟐 𝒏𝝅

5. Conclusion
Fourier series is a useful thing to know in the modern world. There
are applications of this field in virtually all scientific and technological
disciplines. Although it is lengthy math it is very useful and more applicable.
The Fourier Series and transform itself predicts a continuous form of
given discrete data, and the transform here performs a nonstationary shift on
this continuous function.
with these techniques, Fourier series and Transforms have become
an integral part of the toolboxes of mathematicians and scientists. Today, it
is used for applications as diverse as file compression (such as the JPEG
image format), signal processing in communications and astronomy,
acoustics, optics and cryptography.

6. References
 http://mathworld.wolfram.com/ForierSeries.html
 http://en.mwikipedia.org
 “Fourier”. Dictionary.com
 B.S. Grewal -Higher Engineering Mathematics