POWER SYSTEM OPERATION AND CONTROL

FORMATION OF NETWORK MATRICES

Introduction
The evolution of power systems began at the end of the 19th century when the few
transmission lines were built. Over the years, the systems were extended and a growing
number of generators and loads were connected. Due to the rapidly increased
consumption, the need to transmit larger amounts of electric power over longer distances
emerged which was met by raising the voltage levels of the power lines. Furthermore, in
order to enable exchanges between different utilities and to improve security, neighboring
systems were connected. Hence, power systems are the products of a long lasting
building process resulting in very large and complex systems. Thus, electric power
networks integrate generation and load centers within each utility system and through
interconnections among neighboring systems, share power with vast regional grids. The
purpose of this is to take advantage of the diversity of loads, changes in peak demand due
to weather and time differences, the availability of different generation reserves in
various geographic regions, power sharing arrangements among utilities, shifts in fuel
prices, regulatory changes, and other discrepancies. The key limitation of electrical
energy is its storage. Hence, precise controls are required to be adopted to match
generation and demand. However, if the equality constraint is not maintained, there is a
possibility of major regional blackouts that occurred in the US Northeast in 1965, 1977,
1996, 2003 and Great Blackout of 2011. To reduce the risk of such failures, the
transmission networks are interconnected into regional, national or continental networks
thereby exploring the opportunities of alternate routes in the event of emergency.
The practical power system consists of the network of several transmission lines,
buses, transformers and other equipments. The electrical parameters at each bus can be
computed using load flow studies. The manual calculation of load flow analysis can be
performed conveniently for small number of buses, but as the new system is added to the
existing ones, the manual calculations become more and more difficult. Consider the
following figure 1.
1 2
1 Z12
G 7
5 Z23
Z14 2
Z25
5
Z45 4 Z35 8 3
4
3 6 Z56 Z36
Z46 9
6

Fig. 1 A Sample Power System

The voltage at various buses can be computed using any method of load flow analysis.
For example, the voltage at any bus ‘ith’ in general using Gauss Seidel method is
expressed as:

1
POWER SYSTEM OPERATION AND CONTROL

 
1  Pi  jQi n

Vi   *
  YikVk  i  2, 3, ......................n (1)
Yii  Vi k 1 
 k i 

The computer methods are used for the analysis of large interconnected power systems
where the manual calculations are not possible. While using a computer-oriented method
for the analysis of a power system, first step is to obtain the mathematical model from the
given physical model. The mathematical model should describe (1) The individual
characteristics of each element & (2) The interconnections of different elements.

Network Matrix
The most suitable and convenient method of analysis for a power system using digital
computers is by the network matrix. The elements of the network matrices depend upon
the type of the independent variables used. In electrical power systems we can have only
two types of independent variables, voltage or current. If the currents are the independent
variables, then the network matrix elements are the impedances. On the other hand if the
voltages are the independent variables then the network matrix elements are the
admittances for example [V] = [Z][I] & [I] = [Y][V].
Depending on the reference frame used, the voltages and currents could be on the
loop basis as on bus basis or on branch basis. Thus for power system analysis, following
three reference frames are used.

Bus Reference Frame

If bus voltages and bus currents are dependent and independent variables respectively,
the reference frame is known as bus reference frame. Similarly, loop reference frame and
branch reference frame can be defined.

Loop Reference Frame

If loop voltages and loop currents are dependent and independent variables respectively,
the reference frame is known as loop reference frame.

Branch Reference Frame

If branch voltages and bus currents are dependent and independent variables respectively,
the reference frame is known as branch reference frame.

Primitive Matrices (Primary Matrices)

These are the basic matrices describing the individual characteristics of each element
separately but it does not give any information about the interconnection of these
elements. However, when a primitive matrix is used with an incidence matrix, the
required network matrix can be obtained.

Incidence Matrices
Incidence matrix defines only the interconnections of the different elements with each
other and does not give any information about their individual characteristics. When an
incidence matrix is used with a primitive matrix, the primitive matrix is transformed into

2
POWER SYSTEM OPERATION AND CONTROL

required network matrix. For example; bus element incidence matrix, branch path
incidence matrix, loop incidence matrix, basic cut set incidence matrix etc.

Terms used in Incidence Matrix

Network Graph: The network graph is also called as the collection of different points
called as the nodes and different lines called as elements. The buses are interconnected
through elements.
Oriented Graph: It is a network graph in which all the elements are shown with the
assumed or given directions.
Sub Graph: A subset of oriented graph is known as subgraph.
Path: A subgraph in which all the buses have maximum two branch incidence or in other
words, A path is a sub-graph of connected elements with not more than two elements
connected to any node.
Connected graph: A subgraph in which there is at least one path between a pair of buses
or nodes.
Tree: A connected subgraph consisting of all the buses or nodes from the graph without
forming any closed path.
Branch: Elements, which are present in the tree, are called as branches.
Co-tree: From the oriented graph, if a tree is removed, the result is known as co-tree or
complement of tree.
Link: The elements, which are present in the co-tree, or the elements, which are not
present in the tree, are called as links.

For e.g. 2 3
L1
1 3
 1 2 
 
 

 6
G1 T L2 L3 G2

4 5
4
7
G3

Elements: 1,2,3,4,5,6 & 7. Buses: 1,2,3 & 4.

4 4

1 2 3 4 1 2 2 3 3 5 4
2 3 5

6 7 6 7
1 1

Graph 0 Oriented Graph 0

3
POWER SYSTEM OPERATION AND CONTROL

4 4

3 1 2 2 3 3 4
1 2 2 4

6 1
1

0 Fig. (b) 0
Fig. (a)
Path (Also a tree, Branches: 1,2,4,6) Tree. (Branches: 1,2,3,4)

1 2 3 3 5 4 1 2 3 5 4

7 6 7
Cotree of fig (a) Cotree of fig (b)

0 0

Basic Loops (Individual loops)

Since each link form a closed path, the number of basic or independent loops are
equal to the number of links i.e., the closed path is formed such that it consists of only
one link is known as the basic loop or independent loop. For e.g. The basic loops for the
above problem are as shown below.

1 2 2 3 3 5 4

6 7
1

0
No of basic loop = no of links.

Basic Cut Sets

The basic cut sets are the set of elements from the graph such that if any one element
from this network is removed, the graph is divided into two parts. Each basic cut set
consists only one branch at a time and may have any number of links. The orientation of
basic cut set is chosen to be the same as that of its branch.
No of basic cut sets = no of branches.
For the above example, the basic cut sets are as shown below:

4
POWER SYSTEM OPERATION AND CONTROL

1 2 3 4 1,2,3,4
2 3 5

A 6 7 A 1 7
1 6

Fig. (a) 0 0
4

1 2 2 3 3 5 4 0,1,2,4

C
6 7 6
1 5 C 3

Fig. (b) 0 3

4
B

1 2 2 3 3 5 4 2,3,4

6 7 7
1 6 B 2

Fig. (c) 0 1,0

4 D

1 2 2 3 3 5 4 0,1,2,3

6 7 7
1 5 D 4

Fig. (d) 0 4

Standard symbols
n Total number of nodes in system including reference nodes.
n-1 number of buses (excluding the reference frame). Generally ground is taken
reference.
e Total number of elements in power system.
b number of branches in tree.
l number of links in tree.
e=b+l = Number of branches + Number of links
b = (n –1 )
b Number of basic cut sets

5
POWER SYSTEM OPERATION AND CONTROL

OR Number of branches = Number of buses (excluding reference bus)

Number of basic loops = Number of links
Number of basic loops = number of elements – number of branches.
l = e – b = e – (n –1) = e – n + 1


Node Element Incidence Matrix  A
This gives the incidence of different elements on different nodes with their directions.
The elements of the matrix are as follows:
aij = 1 if ith element is incident to (connected) and directed (oriented) away from jth node
aij = -1 if ith element is incident to (connected) and directed (oriented) towards jth node.
aij = 0 if ith element is not incident to (connected).
The dimension of this matrix is e x n.

NUMERICAL 1

For the figure shown below, write the node element incidence matrix  A
 
Using node 1 as reference, also write bus – incidence matrix.

2 2 3

1 5
3

1 4 4

Solution:
2 3
2 In node element / bus element incidence
matrix, the rows on the top correspond to
1 3
5 branches only i.e., elements present in the
tree. The best way is to form the tree and
then label the element numbers if not
4
1 4 mentioned in the data.
Oriented Graph

6
POWER SYSTEM OPERATION AND CONTROL

Node Element Incidence Matrix

Nodes
1 2 3 4 In each row of node element matrix, there
1 1 1 0 0 
Elements 
must be two non-zero entries out of which,
2 0 1  1 0  one should be +1 and another should be
  –1 because one element can incident only
 A e x n  5 x 4  4 1 0 0  1 on two nodes. If it is away from one node,
 
3 1 0  1 0  it has to be towards another node.i.e., sum
of the entries in any row of Augmented
5 0 0 1  1 node element matrix must be zero

Bus Element Incidence Matrix or Bus Incidence Matrix [A]e x (n-1)

Here out of n number of nodes, any one node from the system is taken as reference node.
Generally, always ground is taken as reference node. If the column corresponding to the

reference node is eliminated from the node element incidence matrix [ A] , the result is
known as bus element incidence matrix [A]. The dimension of this matrix [A] is e x (n-1)
For eg. If node ‘1’ is taken as reference then bus incidence matrix will be as [A]5x3.

Bus
2 3 4
Element 1  1 0 0 
2  1  1 0  Ab Branch
A 5 x3  4  0 0  1 
 
3  0 1 0  Al Links
5  0 1  1
where

[Ab] b x (n-1) This gives the incidence of tree branches to buses and is always a square
matrix and hence non-singular.
[Al] l x (n-1) This gives the incidence of links on buses.

Branch Path Incidence Matrix or Path Incidence Matrix [K]b x (n-1)

The branch path incidence matrix gives the incidence of branches in paths. A path always
starts from bus and traverses towards reference node in the tree. Thus number of paths in
a network graph is equal to the number of buses (n-1). The elements in this matrix are
given as follows:
Kij = 1 if ith branch is present in jth path and oriented in the direction of path.
Kij = -1 if ith branch is present in jth path and oriented in the opposite direction of path.
Kij = 0 if ith branch is not incident in jth path.

7
POWER SYSTEM OPERATION AND CONTROL

Bus 2 3
2
2 3 4
3
Branch 1  1  1 0  1
5
[K ]  2  0  1 0 
4
4  0 0  1 1 4

[K]branches x buses
[K]branches x paths
[K]b x (n-1).
Oriented Graph
Number of paths = Number of branches
This gives incidence of branches in paths and is always a square
matrix and therefore non-singular.

Relationship Between Matrix [K] and [A]

[Ab] branch x bus gives the incidence of branches on buses.
[K] bus x branch gives the incidence of different branches in paths.
Since there is one to one correspondence between the above matrices, if multiplied
together, the result is,
[Ab]branch x bus x [K]Tbus x branch = [Ub]branch x branch ………..Identity matrix.
OR [K] T = [Ab] -1
For the above example,
 1 0 0   1 0 0  1 0 0
T   
Ab K    1  1 0   1  1 0   0 1 0 
 0 0  1  0 0  1 0 0 1

Basic Cut Set or Cut Set Incidence Matrix [B]e x b

The basic cut set incidence matrix gives the incidence of different elements on different
cut sets. The number of basic cut sets is the number of branches in a tree. The cut set is
drawn in such a way that it can pass through only branch at a time however, it can pass
through any number of links. The elements of this matrix are given by
bij = 1 if ith element is incident on jth cut set oriented in the same direction as cut-set.
bij = -1 if ith element is incident on jth cut set oriented in opposite direction of cut-set.
bij = 0 if ith element is not incident on jth cut set.
The positive direction of jth cut set corresponds to jth branch direction.
Cut-set B
2 3
A B C 2
Elements 1  1 0 0
2 0 1 0
1 3
5
 A
Ub
B  4 0 0 1 
  Bl
1 4 C
4
3 1 1 0
5  1  1 1

Ub Identity matrix of dimension b x b.

8
POWER SYSTEM OPERATION AND CONTROL

Bl This gives the incidence of links on the cut sets. It is a rectangular matrix and
therefore singular.

Calculation of [Bl] from bus incidence matrix [A] and branch path incidence matrix [K]
 Ab 
A  A  ; Bl  links x branches x Ab  branches x buses  Al 
 l
Thus, if [Bl] matrix is known then by using [Ub] matrix, total [B] can be obtained. The
matrix [B] is always rectangular therefore is singular.

Basic Loop Incidence Matrix or Loop Incidence Matrix [C]

This matrix relates the incidence of elements in different loops with their directions. The
elements of this matrix are given by.
Cij = 1 if ith element is incident in jth loop and oriented in same direction as link direction.
Cij = -1 if ith element is incident in jth loop and oriented in opposite direction as link
direction.
Cij = 0 if ith element is not incident in jth loop.
Positive direction of jth loop is same as jth link direction. Loops
D E
Elements
2
2 3 1  1 1   
Branch 
2  1 1   C 
1 D 3  b
E 5 [C ] e x l  5 x 2  
4 0 1    
   
4
Links 31 0 U l 
1 4
5  0 1   

[Cb] b x l Incidence of different tree branches in basic loops and normally always
rectangular and hence singular.
[Ul] l x l Identity Matrix.
[C] e x l This matrix is rectangular and hence singular.

In order to convert this matrix [C] a square matrix i.e. non singular, loops are added
corresponding to tree branches and known as open loops.

Open Loops: Open loops corresponding to tree branches i.e. one open loop for each tree
branch without any additional element. These loops are used in order to convert loop

incidence matrix [C] as a square matrix C  and known as Augmented Loop Incidence
 
matrix.

9
 POWER SYSTEM OPERATION AND CONTROL

Example 1
For the system shown in figure below, write the bus incidence matrix, branch path
incidence matrix and basic cut set matrix. Prove that (i) [Ab][K]t = [Ub] and (ii) [Bl] =
[Al][K]t. Take bus 1 as reference.

4 5 6
6
5
1 3
7
2 4

1 2 3

Primitive Network
Let
vpq Voltage across element p-q.
epq Source voltage in series with element p-q.
ipq Current through element p-q.
jpq Source current in parallel with element p-q.
zpq Self impedance of element p-q.
ypq Self admittance of element p-q.

Each element has two variables viz. vpq and Ipq. Under steady state conditions, these
elements are zpq and ypq which are real for DC networks and complex for AC networks.
The performance equation in impedance form,
vpq + epq = zpq ipq (1)
The performance equation in admittance form,
ipq + jpq = ypq vpq (2)

Representation of network components jpq

Ep Eq Ep Eq
p zpq q p ypq q
epq ipq ipq epq ipq+ jpq

vpq = Ep - Eq vpq = Ep - Eq
Impedance form Admittance form

 v1 
v 
 2 Column vector of dimension e x 1 representing the total voltage across ‘e’
v' number of elements
 
'
ve  10
POWER SYSTEM OPERATION AND CONTROL

 e1 
e 
 2
Column vector of dimension e x 1 representing the external voltage source
e  '
  in series with elements.
'
ee 

 i1 
i 
 2 Column vector of dimension e x 1 representing the total current flowing
i  ' through the elements
 
'
ie 

[Z] e x e The primitive impedance matrix of e number of elements.

Zpqpq Self impedance of elements connected between node p & q.

Zpqrs Mutual impedance between elements connected between nodes p–q & nodes r-s.

From Equation (2)

i  j  [ y]v (3)
where
 j1 
j 
 2 Column vector of dimension e x 1 representing the external current
j   ' source in parallel with the elements.
 
 '
 j e 

[y] primitive admittance matrix.

The elements of [y], ypqpq are self-admittance of elements connected between node p & q.
Ypqrs are the mutual admittance of elements connected between node p-q and r-s.
[y] = [z]-1.

Network Matrices by Singular Transformation

The network matrices can be written in three frames (a) bus reference frame (b) branch
reference frame (c) loop reference frame.

Bus Reference Frame: In bus reference frame, the performance of an interconnected

network is described by (n-1) independent nodal equations, where ‘n’ is number of nodes.

11
POWER SYSTEM OPERATION AND CONTROL

The performance equation in impedance/admittance form.

Ebus  Z bus I bus ; I bus  Ybus Ebus
Ebus vector of bus voltages measured with respect to reference bus.
I bus vector of impressed bus currents.
Z bus Bus impedance matrix whose elements are open circuit driving point and transfer
impedance.
Ybus Bus admittance matrix whose elements are short circuit driving point and transfer
impedance.

Ybus can be obtained by using bus incidence matrix [A] to relate the variable parameters
of the primitive network to bus quantities of the interconnected network.
i  j  [ y]v
Premultiply by At
At i  At j  At [ y]v (1)
[A] Bus incidence matrix.
t
Ai Vector in which each element is algebraic sum of currents through the network
elements terminating at bus.
According to KCL At i  0 (2);
A j  Algebraic sum of source current at each bus and equals the vector of impressed
t

bus currents.
I bus  At j (3)
From (1), (2) and (3) 0  I bus  At [ y]v (4)
Power into the network  

 I bus
t
Ebus
Sum of the powers in primitive network  j v  
t

For power invariant transformation, both the powers should be same.

I  E
 t
bus  j v
bus   t
(5)
Taking conjugate transpose of equation (3).
I 
 t
bus  j *  A*
t

Now A* = A since ‘A’ is real.

Thus
I 
 t
bus   j*  A
t
(6)
using (6) in equation (5)
j  A E
 t
bus  
 j v
t

Since this is valid for all values of j , it follows that A Ebus  v (7)
The equation (4) is I bus  A [ y]v
t

From (7)
I bus  At [ y] A Ebus (8).

12
 POWER SYSTEM OPERATION AND CONTROL

Since the performance equation is I bus  Ybus Ebus (9)

t
From (8) and (9) Ybus = A [y] A.
Since bus incidence matrix [A] is singular and therefore At[y]A is singular transformation
 At [ y] A .
1 1
of [y]. The bus impedance matrix can be obtained from Z bus  Ybus

Example 2
For the System Shown in figure, write the required matrices to obtain bus admittance
matrix by singular transformation and find Ybus. The values of reactances of different
elements are given in figure. Using Ybus, Take bus 1 as reference.

2 5 3
0.4
0.5

1 0.4
5
4
1.0
0.2
0.5

1 4 4

Solution:
Write the primitive impedance matrix [z]
element element
1 2 3 4 5 1 4 2 3 5
0.5 0 0 0.2 0  0.5 0.2 0 0
element element
1 1 0
2  0 0.4 0 0 0  4 0.2 0.4 0 0 0 
 
[ z ]e x e  j 3 0 0 1.0 0 0  [ z ]e x e  j 2 0 0 0.5 0 0
   
4 0.2 0 0 0.4 0  3 0 0 0 1.0 0 
5  0 0 0 0 0.4 5  0 0 0 0 0.4
 0.5 0.2 1 0 0 0 
  
 0.2 0.4 0 0 0 
 1 
0 0 0 0 
[ y ]  [ z ] 1  j  0.5 
 1 
0 0 0
1
0 
 1 
0 0 0 0 
 0.4 
1
0.5 0.2 1  0.4  0.2  2.5  1.25
0.2 0.4  
  0.2  0.04  0.2 0.5   1.25 3.125 
 

13
POWER SYSTEM OPERATION AND CONTROL

3
 2.5  1.25 0 0 0 2
5
 1.25 3.125 0 0 0 

[ y]  j  0 0 2 0 0 1 4
  3
 0 0 0 1 0
 0 0 0 0 2.5 2
1 4
bus
2 3 4
element 1  1 0 0

4  0  1 0 
2 3 4
[ A]  2  0 0  1
  2  5  3.75 0 
3  0 1  1
Ybus  A y A   j  3.75 6.625  1
5  1  1 0 
T
3
 
4  0 1 3 

Example 3
Using singular transformation, find [Ybus] for the network shown below. Take bus 1 as
reference.
4 3
5(1) 0.5

0.2 5(2) 0.2

2 4
3
0.3
0.3 0.4

1 0.4
0.3
1 2
The Impedance Data:
Element No Self Impedance Mutual Impedance
Bus Code Impedance Bus Code Impedance
1 1–2 0.4
2 1–4 0.3 1-4, 2-4 0.2
3 2–4 0.3
4 2–3 0.4 1-2, 2-3 0.3
5(1) 3–4 0.5
5(2) 3–4 0.2

14
POWER SYSTEM OPERATION AND CONTROL

Example 4
For the network shown in figure, write the primitive impedance and admittance matrices.
1 2
3
0.6 0.1
0.4 0.3
2 4 6
0.5
1
0.5
3 5
0.4
0.2
7
4 5

Solution:

1 2 3 4 5 6 7
1 0.5 0 0 0 0 0 0
2  0 0.4 0 0 0 0 0 
3 0 0 0.6 0.1 0 0 0
 
[ z]  j 4 0 0 0.1 0.3 0 0 0
5 0 0 0 0 0.4 0 0
 
6 0 0 0 0 0 0.5 0 
7  0 0 0 0 0 0 0.2

3 4 5 7 1 2 6
3 0.6 0.1 0 0 0 0 0

4  0.1 0.3 0 0 0 0 0 
5 0 0 0.4 0 0 0 0
 
[Z ]  j 7 0 0 0 0.2 0 0 0
1 0 0 0 0 0.5 0 0
 
2 0 0 0 0 0 0.4 0 
6  0 0 0 0 0 0 0.5

15
POWER SYSTEM OPERATION AND CONTROL

16
POWER SYSTEM OPERATION AND CONTROL

Example 5
For the system shown in fig, obtain YBUS by singular transformation. Assume Node 2 as
reference. The following table gives the reactance data. Using Ybus. Also obtain branch
path incidence matrix K 2
1
Element Bus Code P.U. 1 5 3
Reactance 2
1 1-2 J0.5
2 1-2 J0.5 4
3 1-4 J0.4 3
4 2-4 J0.8
5 2-3 J0.2
4

Solution:
1
1 2
2 5 3
5 1
1 3 2
2
3 4
3 4

4
4
Oriented Graph Tree

Bus incidence matrix [A] or

node element incidence
matrix or bus element
matrix

Node Element
1 3 4 1 3 5 2 4
Element 1 1 0 0 Element 1  j 0.5 0 0 0 0 
3 1 0  1 Ab 3  0 j 0.4 0 0 0 
A  5 0  1 0 [ Z ]e x e  5 0 0 j 0.2 0 0 
   
2 1 0 0 2 0 0 0 j 0.5 0 
Al
4 0 0 1  4  0 0 0 0 j 0.8

17
POWER SYSTEM OPERATION AND CONTROL

The Primitive admittance matrix is as shown below:

2 0 0 0 0 
0 2.5 0 0 0 

[Y ]  [ Z ] 1
  j 0 0 5 0 0 
 
0 0 0 2 0 
0 0 0 0 1.25

2 0 0 0 0  1 0 0 
1 1 0 1 0 0 2.5 0 0 0  1 0  1

YBUS  AT YA   j 0 0  1 0 0 0 0 5 0 0  0  1 0  -
  
0  1 0 0 1 0 0 0 2 0  1 0 0 
0 0 0 0 1.25 0 0 1 

1 0 0 
2 2.5 0 2 0  1 0  1  j 6.5 0 j 2.5 
 
YBUS 
  j 0 0  
 5 0 0  0  1 0    0  j5 0 
 
0  2.5 0 0 1.25 1 0 0   j 2.5 0  j 3.75
0 0 1 

K   Branch path incidence matrix

1 A path starts from a bus and moves

2
5 3 towards reference node. Here the
1
2 reference node is ‘2’.

3 4

4 buses
1 3 4
branches
1 1 0 1 
[K ]  3 0 0  1
5 0  1 0 

18
POWER SYSTEM OPERATION AND CONTROL

Bus Impedance Matrix

During normal operation of power system, it is required to know the voltages, currents and power
flow through the lines. This requires formation of bus impedance matrix (ZBUS) and bus
admittance matrix (YBUS). The bus admittance matrix (YBUS) is used for power flow studies
whereas bus impedance matrix (ZBUS) is used for fault studies (symmetrical and unsymmetrical).
Upon the occurrence of the fault, when the line is switched off by opening the circuit breakers,
the line currents change thereby changing the bus voltages and power flow. The addition or
removal of a line can be easily modeled using ZBUS building algorithm. The process of computing
new steady state voltages and line currents is called as contingency analysis. The large scale
network models need not be exact because the system planners must undertake hundreds of
studies in short period and are concerned about knowing the overload current levels and voltages
that lie beyond the tolerable limits.

Partial Network
A partial network may be considered as having bus impedance matrix for N number of buses. It
being a square matrix, thus the dimension of ZBUS is for N number of buses.

Partial ZBUS for 2 buses (bus 1 and bus 2)

Where

Partial ZBUS for 3 buses (bus 1, 2 and 3)

If ZBUS is to be built from scratch i.e. the first branch element Zb is added between bus no (1) to
the reference bus (0). There is no partial network in this case. Hence, the result of Z BUS on
addition of first branch element is only Zb.
Original

After addition of Zb between bus (0) and (1)

(Case 1)

19
POWER SYSTEM OPERATION AND CONTROL

Before connecting Zb between a new bus (P) and the reference bus (0), the voltages at various
buses for partial network having N number of buses are:

.
.
.

In matrix form

(1)

When a branch having impedance Zb is added between new bus (P) and reference bus (0), the
injected current Ip does not change the bus voltages ( ) of the original network.

However, a row corresponding to VP is added in the voltage column vector where .

If the original ZBUS has dimension (N x N), upon addition of a branch Zb between bus (P) and (0),
the dimension of ZBUS becomes .

Thus, in matrix form

20
POWER SYSTEM OPERATION AND CONTROL

Note that

Thus, new ZBUS becomes

Zb

Before connecting Zb between new bus (P) and the existing bus (k), the voltage at various buses:

.
.

.
.
Note: bus k is any bus between
bus (1) and (N)

21
POWER SYSTEM OPERATION AND CONTROL

In matrix form,

When a branch Zb is added between a new bus (P) and the existing bus (k). The injected current is
Ip at bus (P), the current entering the original network changes from Ik to Ik + IP. This changes the
voltages at various buses. The new voltage at bus k is therefore equal to

When the bus currents are changed from their initial value to new value , the new
bus voltages are given by:

Where the changed voltages are:

It is clear from above equation that

since

When the row corresponding to VP is added in the equation of voltage, after modification, the
voltage equation becomes

22
POWER SYSTEM OPERATION AND CONTROL

It is to be noted that pth row is same as kth row (from 1 to Nth column )
Similarly, pth column is same as kth column ( from 1 to Nth row)
Thus, ( where I varies from 1 to N)
The last row is therefore
(from 1 to Nth column )
The last column is
(from 1 to Nth row )

The new column accounts for the increase in bus voltage due to increase in current from Ik to Ik +
Ip
It is interesting to note that if in CASE 2, the existing bus k is taken as reference, the result
of ZBUS after modification is same as that of case 1.

It reveals that case 1 is the simplification of case 2 if the new bus is (P) and the existing bus (k) is
reference bus. i.e. The above equation can also be used for case 1 for branch addition.

23
POWER SYSTEM OPERATION AND CONTROL

For modeling addition of Zb between the existing bus (k) and reference bus (0), the element Zb is
added between bus (k) and bus (P). The bus (P) is then short circuited with the reference bus (0)
such that VP = 0 (ground potential)

For ZBUS modification, we create new row and column exactly same as in CASE 2.

Sometimes it is desirable to reduce the network by eliminating the nodes at which the bus
voltage is zero.
(A)
is the vector containing voltages at various buses and is the null vector. The
matrix is partitioned with . Note that contains due to its
symmetric nature.
From the above equation,
(B)
And
or (C)

Using Eq. (C) in (B), we get

24
POWER SYSTEM OPERATION AND CONTROL

Therefore,

The new elements of are computed using the following elementary operations.

Since VP = 0, the last row (N + 1) and the last column (N + 1) are eliminated by Kron’s
Reduction to yield (N x N) matrix as:

After modification, ZBUS becomes.

The dimension of ZBUS does not change in CASE 3. Since no new bus is added, the dimension of ZBUS
remains (N x N).

When a branch Zb is added between the existing buses j and k such that the current Ip flows from
bus k to bus j. The currents entering the original networks are and . This results in

change in voltage at all other buses according to the following equation. This equation is similar to
that has been used in Case 2

25
POWER SYSTEM OPERATION AND CONTROL

In general

Thus

(i)

(ii)

From Fig.
And

(iii)
Thus using Eqs. (i) and (ii) in Eq (iii), we get

26
POWER SYSTEM OPERATION AND CONTROL

Writing equations in matrix form

Using Kron’s Reduction, the last row and column is eliminated by using the equation.

It is interesting to note that if any bus either j or k is taken as reference, the result of above
equation is same as that of Case 3.

ADDITION OF A NEW ELEMENT

The addition of a new element in the power system adds a bus in the existing system. The ZBUS is
considered the matrix of a partial network at that stage and the new elements are added one at a
time to produce the new ZBUS.

REMOVAL OF A BRANCH ELEMENT FROM THE NETWORK

The removal of an element from the network can be treated as addition of a link in parallel with
the element which is required to be removed. The impedance of the link should be such that the
parallel combination of the impedance should be infinity so that no current flows through it.
Thus, the removal of an element is the addition of a link in parallel with the element having
impedance magnitude but of opposite sign. For example: If we want to remove the element of
impedance ‘X’, it can be achieved (modeled) by addition of a link in parallel with this element of
the impedance ‘-X’ so that the parallel combination is equal to infinity. i.e. open circuit.

CHANGE IN IMPEDANCE OF AN ELEMENT

Similarly, the change in the impedance of an element can be considered as the addition of a link
in parallel with the element. The impedance of this link should be such that the parallel
combination of the link with the original element gives the impedance of the required value.

27
POWER SYSTEM OPERATION AND CONTROL

28
POWER SYSTEM OPERATION AND CONTROL

29
POWER SYSTEM OPERATION AND CONTROL

30
POWER SYSTEM OPERATION AND CONTROL

31
POWER SYSTEM OPERATION AND CONTROL
NOTE: For more numerical problems on ZBUS building algorithm, students are suggested
to follow V sem AEPS notes.
Write the difference between Ybus and Zbus
Bus Admittance Matrix
The dimension of bus admittance matrix (n
– 1) x (n – 1) where n is the no of nodes
and (n – 1) is number of buses.
In bus reference frame, if the bus voltages
and bus currents are independent and
dependent variables respectively, the
network matrix is an admittance.
JBUS = YBUS VBUS. and
YBUS is symmetric.
Each diagonal admittance Yii (i = 1,2,3, n-
1) is called the self-admittance (or driving
point admittance) of node i and equals the
algebraic sum of all admittances
terminating on the node.
Each off-diagonal admittance Yik (i, k = 1,
2, 3, n-1) is the mutual admittance (transfer
admittance) between nodes i and k and
equals the negative of all admittances
connected directly between these nodes.
Further Yik = Yki.
Yik is 0 if buses i and k are not connected.
For large interconnected power network,
Ybus of a large network is very sparse.
Sparsity in YBUS is greatest advantage as it
heavily reduces computer memory and
time requirements.
Bus admittance matrix is often used in
solving load flow problems.
YBUS has simplicity of data preparation and
can be modified for network changes –
such as addition of lines, regulating
transformers etc.
Bus Impedance Matrix
The dimension of bus impedance matrix is
also (n – 1) x (n – 1) where n is the no of
nodes and (n – 1) is number of buses.
In bus reference frame, if the bus voltages
and bus currents are dependent and
independent variables respectively, the
network matrix is an impedance.
VBUS = ZBUS JBUS . and
ZBUS is also symmetric.
Each diagonal element of ZBUS is called
driving point impedance of the nodes
Each off-diagonal element of YBUS is called
transfer impedances of the nodes. Zik = Zki
ZBUS is a full matrix, i.e., zero elements of
YBUS become non – zero in the
corresponding ZBUS elements.
Formation of ZBUS requires either matrix
inversion or use of involved algorithms.
Bus impedance matrix is suitable for short
circuit studies.
Any modification of the network does not
require complete rebuilding of ZBUS.
32
POWER SYSTEM OPERATION AND CONTROL

For a 4 bus system shown in Fig. form ZBUS using building algorithm. The reactances are
given in per unit. Take bus 2 as reference.

1 2
1
j0.5
2 j0.5 j0.2 4

j0.3
3
3 4
Solution:
Taking elements 1, 2, 3 as branches and 4 as link.
With node 2 as reference, when element 1 is added between bus 2 and 1, ZBUS becomes

When element 2 is added, ZBUS becomes

When element 3 is added, ZBUS becomes

When element 4 is added, it is a link, let j = 4 and k = 2

Thus

And

After modification

33
POWER SYSTEM OPERATION AND CONTROL

(A)

YBUS by inspection

Inversion of YBUS

Thus

34
POWER SYSTEM OPERATION AND CONTROL

Sparsity in Ybus matrix:

An element in Ybus has a non-zero value, if the two buses are directly connected through a
transmission lie or a transformer. The non existence of a direct connection between two
buses means that the off-diagonal transfer admittances of the Ybus matrix will be zero.
Normally in a large interconnected power system, each bus may be connected with a few
neighbouring buses. The non-existence of a direct connection between many buses means
that the vast majority of a real world Ybus matrix will be zero. Thus, for a large power
system, Ybus matrix is highly sparse. In large systems sparsity may be as high as 97%. It
may, however, be noted that whereas Ybus is a highly sparse matrix, its inverse Zbus is
always full.
Further, the Ybus matrix of a power systems is symmetric; therefore, it suffices if
only the diagonal self-admittances and the elements of upper or lower triangular half of
the Ybus matrix are stored. Thus, in a Ybus matrix of order n, the number of elements
required to be stored is n(n+1)/2.
The storage requirement of a Ybus matrix, for a large system having buses of the
order of a few thousand, increases tremendously when it is stored in the conventional
two-dimensional arrays. Further, the computational time also increases since several
arithmetic operations are required to be performed on non zero elements. In order to save
both the storage requirement and computation time, it is essential to take advantage of the
sparsely populated Ybus matrix.
The non zero elements of a sparse matrix are stored in a single dimensional array
with two tables; one of which gives the column number and the other gives the starting
position of the next row. The storage of only non-zero elements can be best explained by
an example. Figure (1) below shows a sparse matrix of a seven bus hypothetical network.
Only the non-zero elements are indicated in the matrix.
y11 y13
y22 y23 y26
y31 y32 y33 y34
y43 y44
y55 y57
y62 y66
y57 y77

The storage of the Ybus matrix, along with the two single dimension tables, shown in Fig
(2).

Fig 2.

35
POWER SYSTEM OPERATION AND CONTROL

The non-zero elements of the Ybus matrix are stored in a single dimensional table elem
and the position of the diagonal element of each row is shown in the pos table. Thus, the
diagonal element of each row two is in the third position, while the third row starts from
the sixth position. It is also to be noted that the difference between any two values in the
pos table gives the number of elements in the pos table [pos (4) – pos (3) = 8-6 = 2]
shows that the number of elements in the third row is two. It is also to be noted that the
length of the elem and col tables is equal to the number of non zero elements of Ybus,
when only the upper triangle along with the diagonal elements are stored.

Numbering schemes to conserve sparsity:

From the foregoing, it is evident that both triangular factorization (LU decomposition) of
Ybus and network reduction lead to the creation of non-zero terms. In other words, the
number of non-zero terms added to Ybus during triangular factorization or network
reduction depends on the sequence in which the rows are processed. Three numbering
schemes, presented by Tinney, helps in conserving sparsity in the Ybus matrix, Essentially
the scheme re-numbered, the system nodes in a defined manner so that the number of
added non-zero terms is minimum.
Tinney’s schemes for near optimal ordering are as follows:

Major diagonal banding scheme

Number the rows of the matrix according to the number of off diagonal terms before
elimination. The row with the least number of terms is eliminated first. In this scheme,
the elements form a band around the major diagonal as shown here with non-zero
elements shown by ‘X’.

Fig. 3
Tinney’s numbering scheme (1):
Number the rows such that at each step of the process the next row to be operated is the
one with the fewest non-zero terms. If more than one row meets this criterion, select any
one. This scheme requires a simulation of the effects on the accumulation of non-zero
terms of the elimination process. The input data is a list by rows of the column numbers
of the non-zero off-diagonal terms.

36
POWER SYSTEM OPERATION AND CONTROL

Tinney’s numbering scheme (2):

Number the rows so that at each step of the process the next row to be operated is the one
that will introduce the fewest non-zero terms. If more than one row meets this criterion,
select any one. This scheme involves a trial simulation of the elimination process at each
step. Input information is the same as for scheme (1).

37