05..heaviside's Expansion Formula
05..heaviside's Expansion Formula
05..heaviside's Expansion Formula
P( s) n P( k )
e t .
1
then L k
Q( s) k 1 Q( k )
Proof: Since P(s) is a polynomial of degree less than that of
Q(s) and Q(s) has distinct roots 1 n , we can write according
to the method of partial fraction
P( s ) A A2 An
1 (1)
Q ( s ) s 1 s 2 s n
Multiplying both sides of (1) by s k and putting s k , we
find using L. Hospital’s rule
P( s)
Ak Lt (s k )
s k Q ( s )
s k
Lt P( s)
s k Q( s )
1 P( k ) 0
Lt P( s) Lt 0 form
s k s k
Q( s) Q( s)
P(1 )
A1 ,
Q (1 )
P( 2 ) P( n )
similarly A2 An
Q( 2 ) Q( n )
P( s) P(1 ) 1 P( 2 ) 1 P( n ) 1
Q( s) Q(1 ) s 1 Q( 2 ) s 2 Q( n ) s n
P( s) P(1 ) 1t P( 2 ) 2 t P( n ) n t
L1 .e e e
Q( s) Q(1 ) Q( 2 ) Q( n )
n
P( k ) k t
.e . proved
k 1 Q( k )
1 s2
Exam-1 Evaluate : L . by using Heaviside’s
( s 1)( s 2)( s 3)
expansion formula
Solution: Here P(S ) s 2 , Q( s) (s 1)(s 2)(s 3)
Q(s) (s 1)[(s 3) (s 2) (s 2)(s 3)
(s 1)(s 3) (s 1)(s 2) (s 2)(s 3)
1 s2 1 t 4 2 t 9
L e e e 3t
( s 1)( s 2)(s 3) 2 (1) (2)(1)
et 9
4e 2t e 3t . Answer
2 2
For repeated roots: In the of case Q(s) has repeated linear
P( s) ( s)
factors, we can write f ( s)
Q( s) ( s ) n1
where (s) is the quotient of polynomials P(s) and the one
obtained by removing the factor ( s ) n1 from Q(s). Then we
( s) A0 A1 An
have g (s)
(s ) n1
s (s ) 2
(s ) n1
1 1 1
where ( s) , (2)
s2 2 2 4
1
( s)
( s 2) 2
1 1
(2)
(2 2) 2 16
L1{ f n ( s)} (1) n t n F (t )
1 1 1 1 1 1
f ( s) .
16 s 2 16 s 2 4 ( s 2) 2
1 2 t 1 2 t 1 2 t
F (t ) e e te Ans.
16 16 4
2s 3
Evaluate: L1 2
( s 1) ( s 2)
2
2s 3 A0 A1 B0 B1
f ( s)
( s 1) 2 ( s 2) 2 s 1 ( s 1) 2 s 2 ( s 2) 2
2s 3 2 3
Here, ( s) , (1) 1
( s 2) 2
(1 2) 2
2s 3 43
, (2) 1
( s 1) 2 (2 1) 2
2( s 1) 2 (2s 3).2( s 1) 2( s 1) 2(2s 3)
( s)
( s 1) 4 ( s 1)3
2 2
(2) 0
(0 1)
1 1
A0 ( ) (1) 0
1! 1!
1 0
A1 (1) 1
0!
1
B0 (2) 0
1!
1
B1 0 (2) 1
0!
1 1
L1 te t
te 2 t
( s 1) ( s 2)
2 2
5s 2 15s 11
1
Evaluate: L 3
( s 1)( s 2)
5s 2 15s 11 A B0 B1 B2
f ( s)
( s 1)(s 2)3 s 1 s 2 ( s 2) 2 ( s 2)3
P(1) 9 1 Here, P( s) 5s 2 15s 11
A0 Lt
s 1
Q(1) 27 3 P(1) 5 15 11 9
B0
1 1 54 1
20 (2) Q( s) ( s 1)(s 2)3
2 0 ! 2 81 3
Q( s) 3( s 1)(s 2) 2 ( s 2)3
1 1 Q(1) (1 2)3 27
B1 (2) .4 4
2 1! 1
5s 2 15s 11
Q( s )
B2
1 0
(2) 7 . s 1
0!
( s 1)(10s 15) (5s 2 15
Taking inverse laplace Q( s)
( s 1) 2
1 t 1 2t 4 2t 7 2 2 t 10s 15 5s 2 15s
F (t ) e e te t e
3 3 1! 2! s 1 ( s 1) 2
1 1 7 (2 1)(10) (10s 15).1
e t e2t 4te2t t 2 e2t Q( s)
3 3 2 ( s 1) 2