Fourier Best Notes Mod2 Lect7

Mathematics - III
Module - II :: Lecture - 7
Dr. H. K. Patel
Department of Mathematics
Ujjain Engineering College, Ujjain
July - December’ 2020
1/ 22
Dr. H. K. Patel Mathematics - IIIModule - II :: Lecture - 7
Fourier Transforms:
Finite Fourier Cosine Transform
Finite Fourier Sine Transform
2/ 22
1. Finite Fourier Transforms
The Fourier cosine and sine transforms are
defined on [0, ∞) and were obtained from
Fourier cosine and sine integral
representations of the functions. However, in
many applications, we are to deal with
problems defined on finite intervals. In this
case, we define the finite Fourier cosine and
sine transforms and are obtained from the
Fourier cosine and sine series.
3/ 22
Finite Fourier Cosine Transform:
Let the given function f (t) be piecewise
continuous on [0, π]. Then the finite Fourier
cosine transform of f (t) is defined by
Z π
Fc (n) = f (t) cos ntdt
0
where n is an non-negative integer,

n = 0, 1, 2, .... This transform is also denoted
by Cn [f (t)].
4/ 22
The half-range cosine series is given by
π ∞ Z π
1 2X
Z
f (t ) = f (τ )d τ + f (τ ) cos nτ d τ cos nt .
π 0 π n=1 0
In terms of the finite Fourier cosine

transform, we can write this equation as
5/ 22
∞
" #
1 X
f (t) = Fc (0) + 2 Fc (n) cos nt .
π n=1
This result is known as the inverse finite

Fourier cosine transform.
6/ 22
Finite Fourier Sine Transform:
Let the given function f (t) be piecewise
continuous on [0, π]. Then the finite Fourier
sine transform of f (t) is defined by
Z π
Fs (n) = f (t) sin ntdt
0
where n is an integer and n = 1, 2, .... This

transform is also denoted by Sn [f (t)].
7/ 22
The half-range sine series is given by
∞ Z π
2X
f (t ) = f (τ ) sin nτ d τ sin nt .
π n=1 0
In terms of the finite Fourier sine transform,

we can write this equation as
8/ 22
∞
2X
f (t) = Fs (n) sin nt.
π n=1
This result is known as the inverse finite

Fourier sine transform.
9/ 22
2. Finite Transforms of Derivatives
Transforms of First Derivatives:
Assume that f (t) is continuous and f 0(t) is
piecewise continuous on [0, π]. Then
Cn [f 0(t)] = nFs (n) + (−1)n f (π) − f (0)
and
Sn [f 0(t)] = −nFc (n)
where n = 1, 2, ... 10/ 22
Transforms of Second Derivatives:
Assume that f (t) and f 0(t) are continuous
and f 00(t) is piecewise continuous on [0, π].
Then
Cn [f 00(t)] = −n2Fc (n) + (−1)n f 0(π) − f 0(0)
and
Sn [f 00(t)] = −n2Fs (n) − n(−1)n f (π) + nf (0)

where n = 1, 2, ... 11/ 22
REMARKS: In case the functions are
defined in the interval [0, c], then we use the
following formulae for FFCT.
Z c nπt
Fc (n) = f (t) cos dt
0 c
and then the inversion formula would be
∞
" #
1 X nπt
f (t) = Fc (0) + 2 Fc (n) cos .
c n=1
c
Similarly for FFST. 12/ 22

3. Examples
Example 1 Find the finite Fourier sine
transform of f (t) = 1 on (0, 1). Also use the
inverse transform to write the result.
Solution: Applying the finite sine transform
to this function, we obtain
Z 1 h cos nπt i1
Sn {f (t)} = sin nπtdt = −
0 nπ 0
13/ 22

2
1 − cos nπ  , n odd
= = nπ
nπ  0, n even.
Applying the inverse sine transform yields

∞
4 X sin(2n − 1)πt
1= .
π n=1 (2n − 1)
14/ 22
Example 2 Find the finite Fourier cosine
and sine transform of the function f (t) = t
defined in [0, π].
Solution: FFCT: By definition, for n = 0.
Z π
π2
C0[f (t)] = tdt = .
0 2
and for n = 1, 2, 3, ...
Z π
Cn [f (t)] = t cos ntdt.
0
15/ 22
Using integration by parts, we get
π
sin nt cos nt
Cn [f (t)] = t − − 2
n n 0
cos nπ − 1
= .
n2
Hence,
 2
 π ,

n=0
Cn [f (t)] = 2
 cos nπ − 1 , n = 1, 2, ...

n2
16/ 22
FFST: By definition, for n = 1, 2, ...
Z π
Fs (n) = Sn [f (t)] = t sin ntdt.
0
By integration by parts
π
cos nt sin nt
Fs (n) = t − +
n n2 0
cos nπ
⇒ Fs (n) = − .
n
17/ 22
Example 3 Find the finite Fourier cosine
and sine transform of the function
f (t) = sinh at defined in [0, π].
Solution: FFCT: By definition, for n = 0.
Z π
Fc (0) = C0[f (t)] = sinh atdt
0
π
cosh at (cosh aπ − 1)
= = .
a 0 a
18/ 22
and for n = 1, 2, ...
Z π
Fc (n) = Cn [f (t)] = sinh at cos ntdt
0
π
(e at − e −at )
Z
= cos ntdt
0 2
π
e at

1
= (a cos nt + n sin nt)
2 (a2 + n2) 0
π
e −at

1
− (−a cos nt + n sin nt)
2 (a2 + n2) 0
19/ 22
a aπ −aπ
= [(e cos nπ−1)+(e cos nπ−1)]
2(a2 + n2)
a
= (cosh aπ cos nπ −1).
(a2 + n2)
FFST: Proceeding as above, we get

n
Fs (n) = − sinh aπ cos nπ.
(a2 + n2)
20/ 22
4. Exercises
1 The following functions are defined on

[0, π]. Find the FFST and FFCT of
them
(a) f (t) = e −t
(b) f (t) = sin at, a > 0
21/ 22
”THANKS”
22/ 22

Fourier Best Notes Mod2 Lect7

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Fourier Best Notes Mod2 Lect7

Uploaded by

Copyright:

Available Formats

Mathematics - III

July - December’ 2020

where n is an non-negative integer,

In terms of the finite Fourier cosine

This result is known as the inverse finite

where n is an integer and n = 1, 2, .... This

In terms of the finite Fourier sine transform,

This result is known as the inverse finite

Cn [f 0(t)] = nFs (n) + (−1)n f (π) − f (0)

Cn [f 00(t)] = −n2Fc (n) + (−1)n f 0(π) − f 0(0)

Sn [f 00(t)] = −n2Fs (n) − n(−1)n f (π) + nf (0)

Similarly for FFST. 12/ 22

Applying the inverse sine transform yields

FFST: Proceeding as above, we get

1 The following functions are defined on

(b) f (t) = sin at, a > 0

You might also like