4 - Lecture # 4 - Node Elimination Using Matrix Algebra Method
4 - Lecture # 4 - Node Elimination Using Matrix Algebra Method
Chapter 1
Network Equations and Solutions
Lecture No. 4
Node Elimination Using Matrix Algebra Method
By
Dr. Mohamed A. Tawfiek
and
Dr. Ahmed Sayed
1
4. Node Elimination Using Matrix Algebra Method
For a network contains 4-nodes, the node voltage equations can be written in matrix form
as follows :
𝐾 𝐿
𝑌 13 𝑌 14
𝐼𝐴
} 𝐼1
𝐼2
=
𝑌 11
𝑌 21
𝑌 12
𝑌 22 𝑌 23 𝑌 24
𝑉1
𝑉2 }𝑉 𝐴
0 = 𝐼𝑋
} 𝐼3
𝐼4
𝑌 31
𝑌 41
𝑌 32
𝑌 42
𝑌 33
𝑌 43
𝑌 34
𝑌 44
𝑉3
𝑉4 }𝑉 𝑋
𝑁 𝑀
𝐼𝐴 𝐾 𝐿 𝑉𝐴
𝐼𝑋 = 0 Currents of =
eliminated nodes 𝐼𝑋 𝑁 𝑀 𝑉𝑋
Now, it is required to eliminate two nodes 3 and 4. Remark: Nodes at which current
So, we have: does not enter or leave the network
only can be eliminated
𝐼𝐴 = 𝐾 𝑉𝐴 + 𝐿 𝑉𝑋 (1)
𝐼𝑋 = 0 = 𝑁 𝑉𝐴 + 𝑀 𝑉𝑋 (2)
2
4. Node Elimination Using Matrix Algebra Method
𝐼𝐴 = 𝐾 𝑉𝐴 + 𝐿 𝑉𝑋 (1)
𝐼𝑋 = 0 = 𝑁 𝑉𝐴 + 𝑀 𝑉𝑋 (2)
From Equation (2), we get:
−1
𝑀 𝑉𝑋 = − 𝑁 𝑉𝐴 𝑉𝑋 = − 𝑀 𝑁 𝑉𝐴 (3)
−1
𝐼𝐴 = 𝐾 𝑉𝐴 + 𝐿 − 𝑀 𝑁 𝑉𝐴
−1
𝐼𝐴 = 𝐾 − 𝐿 𝑀 𝑁 𝑉𝐴
𝐼𝐴 = 𝑌𝐴 𝑉𝐴
Where:
−1
𝑌𝐴 = 𝑌𝑟𝑒𝑑𝑢𝑐𝑒𝑑 = 𝐾 − 𝐿 𝑀 𝑁
Thus, the new node voltage equations can be written as:
𝐼1 𝑌11 \ 𝑌12 \ 𝑉1
=
𝐼2 𝑌21 \ 𝑌22 \ 𝑉2 3
4. Node Elimination Using Matrix Algebra Method
Example 1.4:
a) For the circuit shown in the figure 1.4, eliminate nodes 3 and 4 by using Matrix
algebra method and then deduce and draw the reduced circuit between nodes 1
and 2and calculate the power outputs of the two sources at nodes 1 and 2.
b) eliminate nodes 3 and 4 by using star-delta transformation.
c) Compare the reduced circuit (a) with star-delta transformation (b).
𝑗 0.1
𝑗 0.05 𝑗 0.025
𝑗 0.5 𝑗1
0
+ + 𝐸 = 1උ00
𝐸1 = 1උ60 2
− −
Figure 1.4. PU Impedance diagram
4
4. Node Elimination Using Matrix Algebra Method
Solution
∵ 𝑤𝑒 ℎ𝑎𝑣𝑒 4 − 𝑛𝑜𝑑𝑒𝑠, 𝑡ℎ𝑒𝑛 𝑤𝑒 ℎ𝑎𝑣𝑒 4 − 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛𝑠
1 − 𝑇𝑟𝑦 𝑡𝑜 𝑐𝑜𝑛𝑣𝑒𝑟𝑡 𝑎𝑛𝑦 𝑉𝑆 𝑡𝑜 𝐶𝑆 −𝑗 10
2 − 𝐶𝑜𝑛𝑣𝑒𝑟𝑡 𝑎𝑛𝑦 𝑥 𝑡𝑜 𝑦
−𝑗 20 3 −𝑗 50 4 −𝑗 20
1 2
40
20
උ−900
උ−300
−𝑗 20 −𝑗 2 −𝑗 1 −𝑗 40
PU admittance diagram
−1
−𝑗50 𝑗10 𝑗20 0 −𝑗72 𝑗50 𝑗20 0
𝑌𝑟𝑒𝑑𝑢𝑐𝑒𝑑 = −
𝑗10 −𝑗70 0 𝑗20 𝑗50 −𝑗71 0 𝑗20
−𝑗71 −𝑗50
−𝑗50 𝑗10 𝑗20 0 −𝑗50 −𝑗72 𝑗20 0
𝑌𝑟𝑒𝑑𝑢𝑐𝑒𝑑 = −
𝑗10 −𝑗70 0 𝑗20 −𝑗72 𝑗50 0 𝑗20
𝑗50 −𝑗71
−𝑗71 −𝑗50
−𝑗50 𝑗10 𝑗20 0 −𝑗50 −𝑗72 𝑗20 0
𝑌𝑟𝑒𝑑𝑢𝑐𝑒𝑑 = −
𝑗10 −𝑗70 0 𝑗20 (−𝑗72) × −𝑗71 − −𝑗50 × −𝑗50 0 𝑗20
71 50
𝑗20 0 −𝑗
𝑌𝑟𝑒𝑑𝑢𝑐𝑒𝑑 =
−𝑗50 𝑗10
− 50 72 𝑗20 0
𝑗10 −𝑗70 0 𝑗20 𝑗 2 2612 0 𝑗20
−50 10 𝑗 20 0 71 50 20 0
𝑌𝑟𝑒𝑑𝑢𝑐𝑒𝑑 = 𝑗 +
10 −70 2612 0 20 50 72 0 20
6
4. Node Elimination Using Matrix Algebra Method
Solution
−50 10 𝑗 20 0 71 50 20 0
𝑌𝑟𝑒𝑑𝑢𝑐𝑒𝑑 = 𝑗 +
10 −70 2612 0 20 50 72 0 20
−50 10 𝑗 20 0 71 × 20 + 50 × 0 71 × 0 + 50 × 20
𝑌𝑟𝑒𝑑𝑢𝑐𝑒𝑑 = 𝑗 +
10 −70 2612 0 20 50 × 20 + 72 × 0 50 × 0 + 72 × 20