100% found this document useful (1 vote)
378 views14 pages

Gaussian Elimination Method PDF

Gaussian elimination is a method to solve systems of linear equations. It proceeds in two stages: 1) Forward elimination reduces the system of equations by eliminating variables 2) Backward substitution uses the reduced system to solve for the remaining variables. The method is demonstrated on a system of 4 equations with 4 unknown voltages. Forward elimination reduces it to 1 equation with 1 unknown which is then used to solve for the other voltages through backward substitution.

Uploaded by

Umer farooq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
378 views14 pages

Gaussian Elimination Method PDF

Gaussian elimination is a method to solve systems of linear equations. It proceeds in two stages: 1) Forward elimination reduces the system of equations by eliminating variables 2) Backward substitution uses the reduced system to solve for the remaining variables. The method is demonstrated on a system of 4 equations with 4 unknown voltages. Forward elimination reduces it to 1 equation with 1 unknown which is then used to solve for the other voltages through backward substitution.

Uploaded by

Umer farooq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Gaussian Elimination

Method
WEEK 2
A technique used to solve linear simultaneous equations.
There are two stages:
1. Forward Elimination
2. Backward Substitution
The approach is designed to solve a general set of equations and unknowns.
• Gaussian elimination consists of reducing this system of three equations and three unknowns
into a system of two equations and two unknowns.

• And then to reduce a system of two equations in two unknowns, and so on until there remains
only one equation in one unknown.

• The final equation yields a value for the corresponding unknown, which is then substituted
back in the reduced sets of equations to calculate the remaining unknowns.

• The successive elimination of unknowns in the forward direction is called forward elimination
and the substitution process using the latest calculated values is called backward substitution.
Forward Elimination
Backward Substitution
𝑌11 𝑌12 𝑌13 𝑌14 𝑉1 𝐼1 Divide by 𝑌11 .
𝑌21 𝑌22 𝑌23 𝑌24 𝑉2 𝐼
= 2
𝑌31 𝑌32 𝑌33 𝑌34 𝑉3 𝐼3
𝑌41 𝑌42 𝑌43 𝑌44 𝑉4 𝐼4

𝑌12 𝑌13 𝑌14 𝐼1


1 𝑉1 Multiply by 𝑌21 , 𝑌31 and 𝑌41
𝑌11 𝑌11 𝑌11 𝑉 𝑌11 And subtract from eq 2,3 and 4
2
𝑌21 𝑌22 𝑌23 𝑌24 𝑉 = 𝐼2
3 respectively.
𝑌31 𝑌32 𝑌33 𝑌34 𝑉 𝐼3
4
𝑌41 𝑌42 𝑌43 𝑌44 𝐼4 Superscript 1 shows that the values have been
(1) 𝑌 𝑌12
updated once and is equal to 𝑌22 = 𝑌22 − 21 .
𝐼1 𝑌 11

𝑌12 𝑌13 𝑌14 𝑌11


1 𝑌21 𝐼1
𝑌11 𝑌11 𝑌11 𝑉1
(1) (1) (1) 𝑉2
𝐼2 −
𝑌11 Divide by 𝑌22 (1) Step 1 coefficients can be derived easily as
0 𝑌22 𝑌23 𝑌24 =
(1) (1) (1) 𝑉3 𝑌31 𝐼1
0 𝑌32 𝑌33 𝑌34 𝑉4 𝐼3 − (1) 𝑌𝑗1 𝑌1𝑘
𝑌11 𝑌𝑗𝑘 = 𝑌𝑗𝑘 − for j and k = 2,3,4
(1) (1) (1) 𝑌11
0 𝑌42 𝑌43 𝑌44 𝑌21 𝐼1 (1)
𝐼4 − 𝐼4
𝑌11 𝑌𝑗1
𝐼𝑗1 = 𝐼𝑗 − 𝐼
𝑌11 1
We have eliminated the first variable from all equations
and reduced the system into three equations with three unknowns.
𝑌12 𝑌13 𝑌14 𝐼1
1 𝑌11 𝑌11 𝑌11 𝑌11
(1) (1) 𝑉1 (1)
𝑌23 𝑌24 𝐼2 (1) (1)
0 1 (1) (1) 𝑉2 (1) Multiply by 𝑌32 and 𝑌42
𝑌22 𝑌22 = 𝑌22
𝑉3 And subtract from eq 3 and 4
(1) (1) (1) (1)
0 𝑌32 𝑌33 𝑌34 𝑉4 𝐼3 respectively.
(1) (1) (1) (1)
0 𝑌42 𝑌43 𝑌44 𝐼4

𝑌12 𝑌13 𝑌14 𝐼1


1 𝑌11 𝑌11 𝑌11 𝑌11
(1) (1) 𝑉1 (1)
𝑌23 𝑌24 𝐼2
0 1 (1) (1) 𝑉2 (1)
𝑌22 𝑌22 = 𝑌22
𝑉3
(2) (2) (2) 2 (2)
0 0 𝑌33 𝑌34 𝑉4 𝐼3 Divide by 𝑌33 . Multiply by 𝑌43
(2) (2) (2) And subtract from eq 4
0 0 𝑌43 𝑌44 𝐼4
respectively.

We have eliminated the second variable from last two equations


and reduced the system into two equations with two unknowns.
𝑌12 𝑌13 𝑌14 𝐼1
1
𝑌11 𝑌11 𝑌11 𝑌11
(1) (1) (1)
𝑌23 𝑌24 𝑉1 𝐼2
0 1 (1)
𝑌22
(1)
𝑌22 𝑉2 𝑌
(1)
= 22
(2) 𝑉3 (2)
𝑌34 𝑉4 𝐼3
0 0 1 (2) (2)
𝑌33 𝑌33
(3) (3)
0 0 0 𝑌44 𝐼4

We have eliminated the third variable from last equation


and reduced the system into one equations with one unknown.

(3)
𝐼4
Now we can find the value for 𝑉4 = (3) and go backward to find value of 𝑉3 , 𝑉2 and 𝑉1 in subsequent steps.
𝑌44
Find the voltages for the four bus system whose nodal admittance equations are given, by using
successive elimination.
−𝒋𝟏𝟔. 𝟕𝟓 𝒋𝟏𝟏. 𝟕𝟓 𝒋𝟐. 𝟓 𝒋𝟐. 𝟓 𝑉1 0
𝒋𝟏𝟏. 𝟕𝟓 −𝒋𝟏𝟗. 𝟐𝟓 𝒋𝟐. 𝟓 𝒋𝟓 𝑉2 0
=
𝒋𝟐. 𝟓 𝒋𝟐. 𝟓 −𝒋𝟓. 𝟖 𝟎 𝑉3 1 < −90°
𝒋𝟐. 𝟓 𝒋𝟓 𝟎 −𝒋𝟖. 𝟑 𝑉4 0.68 < −135°

𝟏 −𝟎. 𝟕𝟎𝟏𝟒𝟗 −𝟎. 𝟏𝟒𝟗𝟐𝟓 −𝟎. 𝟏𝟒𝟗𝟐𝟓 𝑉1 0 Multiply by 𝑌21 , 𝑌31 and 𝑌41
𝒋𝟏𝟏. 𝟕𝟓 −𝒋𝟏𝟗. 𝟐𝟓 𝒋𝟐. 𝟓 𝒋𝟓 𝑉2 0 And subtract from eq 2,3 and 4
=
𝒋𝟐. 𝟓 𝒋𝟐. 𝟓 −𝒋𝟓. 𝟖 𝟎 𝑉3 1 < −90° respectively.
𝒋𝟐. 𝟓 𝒋𝟓 𝟎 −𝒋𝟖. 𝟑 𝑉4 0.68 < −135°

𝟏 −𝟎. 𝟕𝟎𝟏𝟒𝟗 −𝟎. 𝟏𝟒𝟗𝟐𝟓 −𝟎. 𝟏𝟒𝟗𝟐𝟓 𝑉1 0


𝟎 −𝒋𝟏𝟏. 𝟎𝟎𝟕𝟒𝟔 𝒋𝟒. 𝟐𝟓𝟑𝟕𝟑 𝒋𝟔. 𝟕𝟓𝟑𝟕𝟑 𝑉2 0
=
𝟎 𝒋𝟒. 𝟐𝟓𝟑𝟕𝟑 −𝒋𝟓. 𝟒𝟐𝟔𝟖𝟔 𝒋𝟎. 𝟑𝟕𝟑𝟏𝟑 𝑉3 1 < −90°
𝟎 𝒋𝟔. 𝟕𝟓𝟑𝟕𝟑 𝒋𝟎. 𝟑𝟕𝟑𝟏𝟑 −𝒋𝟕. 𝟗𝟐𝟔𝟖𝟔 𝑉4 0.68 < −135°
𝟏 −𝟎. 𝟕𝟎𝟏𝟒𝟗 −𝟎. 𝟏𝟒𝟗𝟐𝟓 −𝟎. 𝟏𝟒𝟗𝟐𝟓 𝑉1 0
𝟎 𝟏 −𝟎. 𝟑𝟖𝟔𝟒𝟒 −𝟎. 𝟔𝟏𝟑𝟓𝟔 𝑉2 0 (1) (1)
= Multiply by 𝑌32 and 𝑌42
𝟎 𝒋𝟒. 𝟐𝟓𝟑𝟕𝟑 −𝒋𝟓. 𝟒𝟐𝟔𝟖𝟔 𝒋𝟎. 𝟑𝟕𝟑𝟏𝟑 𝑉3 1 < −90°
𝟎 𝒋𝟔. 𝟕𝟓𝟑𝟕𝟑 𝒋𝟎. 𝟑𝟕𝟑𝟏𝟑 −𝒋𝟕. 𝟗𝟐𝟔𝟖𝟔 𝑉4
And subtract from eq 3 and 4
0.68 < −135°
respectively.

𝟏 −𝟎. 𝟕𝟎𝟏𝟒𝟗 −𝟎. 𝟏𝟒𝟗𝟐𝟓 −𝟎. 𝟏𝟒𝟗𝟐𝟓 𝑉1 0


𝟎 𝟏 −𝟎. 𝟑𝟖𝟔𝟒𝟒 −𝟎. 𝟔𝟏𝟑𝟓𝟔 𝑉2 0
=
𝟎 𝟎 −𝒋𝟑. 𝟕𝟖𝟑𝟎𝟓 𝒋𝟐. 𝟗𝟖𝟑𝟎𝟓 𝑉3 1 < −90°
𝟎 𝟎 𝒋𝟐. 𝟗𝟖𝟑𝟎𝟓 −𝒋𝟑. 𝟕𝟖𝟑𝟎𝟓 𝑉4 0.68 < −135°

𝟏 −𝟎. 𝟕𝟎𝟏𝟒𝟗 −𝟎. 𝟏𝟒𝟗𝟐𝟓 −𝟎. 𝟏𝟒𝟗𝟐𝟓 𝑉1 0


𝟎 𝟏 −𝟎. 𝟑𝟖𝟔𝟒𝟒 −𝟎. 𝟔𝟏𝟑𝟓𝟔 𝑉2 0
= (2)
𝟎 𝟎 𝟏 −𝟎. 𝟕𝟖𝟖𝟓𝟑 𝑉3 0.26434 < 0° Multiply by 𝑌43
𝟎 𝟎 𝒋𝟐. 𝟗𝟖𝟑𝟎𝟓 −𝒋𝟑. 𝟕𝟖𝟑𝟎𝟓 𝑉4 0.68 < −135° And subtract from eq 4
respectively.

𝟏 −𝟎. 𝟕𝟎𝟏𝟒𝟗 −𝟎. 𝟏𝟒𝟗𝟐𝟓 −𝟎. 𝟏𝟒𝟗𝟐𝟓 𝑉1 0


𝟎 𝟏 −𝟎. 𝟑𝟖𝟔𝟒𝟒 −𝟎. 𝟔𝟏𝟑𝟓𝟔 𝑉2 0
=
𝟎 𝟎 𝟏 −𝟎. 𝟕𝟖𝟖𝟓𝟑 𝑉3 0.26434 < 0°
𝟎 𝟎 𝟎 −𝒋𝟏. 𝟒𝟑𝟎𝟖𝟐 𝑉4 1.35738 < −110.7466°
𝟏 −𝟎. 𝟕𝟎𝟏𝟒𝟗 −𝟎. 𝟏𝟒𝟗𝟐𝟓 −𝟎. 𝟏𝟒𝟗𝟐𝟓 𝑉1 0
𝟎 𝟏 −𝟎. 𝟑𝟖𝟔𝟒𝟒 −𝟎. 𝟔𝟏𝟑𝟓𝟔 𝑉2 0
=
𝟎 𝟎 𝟏 −𝟎. 𝟕𝟖𝟖𝟓𝟑 𝑉3 0.26434 < 0°
𝟎 𝟎 𝟎 −𝒋𝟏. 𝟒𝟑𝟎𝟖𝟐 𝑉4 1.35738 < −110.7466°

You might also like