Smartworld.

asia 1

COMPUTER TECHNCIHQAUPETS EINR- 10EE71

P1OGWrEapRhSTYhSeToEryMS (CTPS)

UNIT-2
NETWORK MATRICES

2. FORMATION OF YBUS AND ZBUS

The bus admittance matrix, YBUS plays a very important role in computer aided power
system analysis. It can be formed in practice by either of the methods as under:
1.Rule of Inspection
2.Singular Transformation
3.Non-Singular Transformation
4.ZBUS Building Algorithms, etc.

The performance equations of a given power system can be considered in three different
frames of reference as discussed below:

Frames of Reference:
Bus Frame of Reference: There are b independent equations (b = no. of buses) relating the
bus vectors of currents and voltages through the bus impedance matrix and bus admittance
matrix:

EBUS = ZBUS IBUS

IBUS = YBUS EBUS (9)
Branch Frame of Reference: There are b independent equations (b = no. of branches of a
selected Tree sub-graph of the system Graph) relating the branch vectors of currents and
voltages through the branch impedance matrix and branch admittance matrix:

EBR = ZBR IBR

IBR = YBR EBR (10)
Loop Frame of Reference: There are b independent equations (b = no. of branches of a
selected Tree sub-graph of the system Graph) relating the branch vectors of currents and
voltages through the branch impedance matrix and branch admittance matrix:

ELOOP = ZLOOP ILOOP

ILOOP = YLOOP ELOOP (11)

Of the various network matrices refered above, the bus admittance matrix (YBUS) and the
bus impedance matrix (ZBUS) are determined for a given power system by the rule
of inspection as explained next.

2.1 Rule of Inspection

Consider the 3-node admittance network as shown in figure5. Using the basic branch
relation: I = (YV), for all the elemental currents and applying Kirchhoff‟s Current Law
principle at the nodal points, we get the relations as under:

At node 1: I1 =Y1V1 + Y3 (V1-V3) + Y6 (V1 – V2) At node 2: I2 =Y2V2 + Y5 (V2-V3)

+ Y6 (V2 – V1)
Smartworld.asia 2

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

At node 3: 0 = Y3 (V3-V1) + Y4V3 + Y5 (V3 – V2) (12)

Fig. 3 Example System for finding YBUS

These are the performance equations of the given network

in admittance form and they can be represented in matrix
form as:

In other words, the relation of equation (9) can be represented in the form
IBUS = YBUS EBUS (14)
Where, YBUS is the bus admittance matrix, IBUS & EBUS are the bus current and bus
voltage vectors respectively. By observing the elements of the bus admittance
matrix, YBUS of equation (13), it is observed that the matrix elements can as well be
obtained by a simple inspection of the given system diagram:
Diagonal elements: A diagonal element (Yii) of the bus admittance matrix, YBUS,
is equal to the sum total of the admittance values of all the elements incident at the
bus/node i,
Off Diagonal elements: An off-diagonal element (Yij) of the bus admittance matrix,
YBUS, is equal to the negative of the admittance value of the connecting element present
between the buses I and j, if any. This is the principle of the rule of inspection. Thus the
algorithmic equations for the rule of inspection are obtained as:

Yii = S yij (j = 1,2,…….n)

Yij = - yij (j = 1,2,…….n) (15)

For i = 1,2,….n, n = no. of buses of the given system, yij is the admittance of element
connected between buses i and j and yii is the admittance of element connected between
bus i and ground (reference bus).
Smartworld.asia 3

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

2.2 Bus impedance matrix

In cases where, the bus impedance matrix is also required, it cannot be formed by direct
inspection of the given system diagram. However, the bus admittance matrix determined
by the rule of inspection following the steps explained above, can be inverted to obtain the
bus impedance matrix, since the two matrices are interinvertible.
Note: It is to be noted that the rule of inspection can be applied only to those
power systems that do not have any mutually coupled elements.

Examples on Rule of Inspection:

Example 6: Obtain the bus admittance matrix for the admittance network shown aside by
the rule of inspection

Example 7: Obtain YBUS for the impedance network shown aside by the rule of
inspection. Also, determine YBUS for the reduced network after eliminating the eligible
unwanted node. Draw the resulting reduced system diagram.
Smartworld.asia 4

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

2.3 SINGULAR TRANSFORMATIONS

The primitive network matrices are the most basic matrices and depend purely on
the impedance or admittance of the individual elements. However, they do not contain
any information about the behaviour of the interconnected network variables. Hence,
it is necessary to transform the primitive matrices into more meaningful matrices
which can relate variables of the interconnected network.
Smartworld.asia 5

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Bus admittance matrix, YBUS and Bus impedance matrix, ZBUS

In the bus frame of reference, the performance of the interconnected network is described
by n independent nodal equations, where n is the total number of buses (n+1nodes
are present, out of which one of them is designated as the reference node).
For example a 5-bus system will have 5 external buses and 1 ground/ ref. bus).
The
performance equation relating the bus voltages to bus current injections in bus frame of
reference in admittance form is given by
IBUS = YBUS EBUS (17)
Where EBUS = vector of bus voltages measured with respect to reference bus
IBUS = Vector of currents injected into the bus
YBUS = bus admittance matrix
The performance equation of the primitive network in admittance form is given by
i + j = [y] v
Pre-multiplying by At (transpose of A), we obtain

At i +At j = At [y] v
(18)
However, as per equation (4),

At i =0,
since it indicates a vector whose elements are the algebraic sum of element
currents incident at a bus, which by Kirchhoff‟s law is zero. Similarly, At j gives
the algebraic sum of all source currents incident at each bus and this is nothing but
the total current injected at the bus. Hence,
At j = IBUS (19)
Thus from (18) we have, IBUS = At [y] (20)
v However, from (5), we have
v =A EBUS
And hence substituting in (20) we get,

IBUS = At [y] A EBUS (21)

Comparing (21) with (17) we obtain,

YBUS = At [y] A (22)

The bus incidence matrix is rectangular and hence singular. Hence, (22) gives a singular
transformation of the primitive admittance matrix [y]. The bus impedance matrix is given
by ,

ZBUS = YBUS-1 (23)

Note: This transformation can be derived using the concept of power invariance, however,
since the transformations are based purely on KCL and KVL, the transformation
will obviously be power invariant.
Smartworld.asia 6

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Examples on Singular Transformation:

Example 8: For the network of Fig E8, form the primitive matrices [z] & [y] and obtain
the bus admittance matrix by singular transformation. Choose a Tree T(1,2,3). The data is
given in Table E8.

Fig E8 System for Example-8

Table E8: Data for Example-

8
Smartworld.asia 7

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Solution:
The bus incidence matrix is formed taking node 1 as the reference bus.

The primitive incidence matrix is given by

The primitive admittance matrix [y] = [z]-1 and given by,

The bus admittance matrix by singular transformation is obtained as

Smartworld.asia 8

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

SUMMARY

The formulation of the mathematical model is the first step in obtaining the solution of any
electrical network. The independent variables can be either currents or
voltages. Correspondingly, the elements of the coefficient matrix will be
impedances or admittances.

Network equations can be formulated for solution of the network using graph
theory, independent of the nature of elements. In the graph of a network, the tree-branches
and links are distinctly identified. The complete information about the interconnection of
the network, with the directions of the currents is contained in the bus incidence matrix.

The information on the nature of the elements which form the interconnected network is
contained in the primitive impedance matrix. A primitive element can be represented
in impedance form or admittance form. In the bus frame of reference, the performance of
the interconnected system is described by (n-1) nodal equations, where n is the
number of nodes. The bus admittance matrix and the bus impedance matrix relate the
bus voltages and currents. These matrices can be obtained from the primitive
impedance and admittance matrices.

FORMATION OF BUS IMPEDANCE MATRIX

2.4 NODE ELIMINATION BY MATRIX ALGEBRA

Nodes can be eliminated by the matrix manipulation of the standard

node equations. However, only those nodes at which current does not enter
or leave the network can be considered for such elimination. Such nodes can
be eliminated either in one group or by taking the eligible nodes one after the
other for elimination, as discussed next.

CASE-A: Simultaneous Elimination of Nodes:

Consider the performance equation of the given network in bus frame

of reference in admittance form for a n-bus system, given by:

IBUS = YBUS EBUS (1)

Where IBUS and EBUS are n-vectors of injected bus current and bus voltages
and YBUS is the square, symmetric, coefficient bus admittance matrix of
order n. Now, of the n buses present in the system, let p buses be considered
for node elimination so that the reduced system after elimination of p nodes
would be retained with m (= n-p) nodes only. Hence the corresponding
performance equation would be similar to (1) except that the coefficient
IBUS = YBUS
matrixEBUS
new
would be of order m now, i.e., (2)

Where YBUSnew is the bus admittance matrix of the reduced network and the vectors
Smartworld.asia 9

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

IBUS and EBUS are of order m. It is assumed in (1) that IBUS and EBUS are obtained with their
elements arranged such that the elements associated with p nodes to be eliminated are in the
lower portion of the vectors. Then the elements of YBUS also get located accordingly so that (1) after
matrix partitioning yields,

Where the self and mutual values of YA and YD are those identified only with the nodes to
be retained and removed respectively and YC=YBt is composed of only the
corresponding mutual admittance values, that are common to the nodes m and p.
Now, for the p nodes to be eliminated, it is necessary that, each element of the
vector IBUS-p should be zero. Thus we have from (3):

IBUS-m = YA EBUS-m + YB EBUS-p IBUS-p = YC EBUS-m + YD EBUS-p = 0

(4)

Solving,
EBUS-p = - YD-1YC EBUS-m (5)
Thus, by simplification, we obtain an expression similar to (2) as,
IBUS-m = {YA - YBYD-1YC} EBUS-m (6)
Thus by comparing (2) and (6), we get an expression for the new bus admittance matrix in
terms of the sub-matrices of the original bus admittance matrix as:
YBUSnew = {YA – YBYD -1YC} (7)
This expression enables us to construct the given network with only the necessary nodes
retained and all the unwanted nodes/buses eliminated. However, it can be observed from
(7) that the expression involves finding the inverse of the sub-matrix YD (of order p). This
would be computationally very tedious if p, the nodes to be eliminated is very
large,
especially for real practical systems. In such cases, it is more advantageous to eliminate
the unwanted nodes from the given network by considering one node only at a time for
elimination, as discussed next.

CASE-B: Separate Elimination of Nodes:

Here again, the system buses are to be renumbered, if necessary, such that the node to be
removed always happens to be the last numbered one. The sub-matrix YD then would be a
single element matrix and hence it inverse would be just equal to its own reciprocal value.
Thus the generalized algorithmic equation for finding the elements of the new bus
admittance matrix can be obtained from (6) as,

Yij new = Yij old – Yin Ynj / Ynn " i,j = 1,2,…… n. (8)
Smartworld.asia 10

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Each element of the original matrix must therefore be modified as per (7). Further, this procedure of
eliminating the last numbered node from the given system of n nodes is to be iteratively repeated p
times, so as to eliminate all the unnecessary p nodes from the original system.

Examples on Node elimination:

Example-1: Obtain YBUS for the impedance network shown below by the rule of
inspection. Also, determine YBUS for the reduced network after eliminating the eligible
unwanted node. Draw the resulting reduced system diagram.

The admittance equivalent network is as follows:

The bus admittance matrix is obtained by RoI as:

The reduced matrix after elimination of node 3 from the given system is determined as per the
equation:
Smartworld.asia 11

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Alternatively,

Thus the reduced network can be obtained again by the rule of inspection as shown below.

Example-2: Obtain YBUS for the admittance network shown below by the rule of
inspection. Also, determine YBUS for the reduced network after eliminating the eligible
unwanted node. Draw the resulting reduced system diagram.
Smartworld.asia 12

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Thus the reduced system of two nodes can be drawn by the rule of inspection as under:
Smartworld.asia 13

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

2.5 ZBUS building

FORMATION OF BUS IMPEDANCE MATRIX

The bus impedance matrix is the inverse of the bus admittance matrix. An
alternative method is possible, based on an algorithm to form the bus impedance matrix
directly from system parameters and the coded bus numbers. The bus impedance
matrix is formed adding one element at a time to a partial network of the given system.
The performance equation of the network in bus frame of reference in impedance form
using the currents as independent variables is given in matrix form by

When expanded so as to refer to a n bus system, (9) will be of the form

Now assume that the bus impedance matrix Zbus is known for a partial network
of m buses and a known reference bus. Thus, Zbus of the partial network is of dimension
mxm. If now a new element is added between buses p and q we have the
following two possibilities:
(i) p is an existing bus in the partial network and q is a new bus; in this case p-q is a
branch added to the p-network as shown in Fig 1a, and
Smartworld.asia 14

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

(ii) both p and q are buses existing in the partial network; in this case p-q is a link
added to the p-network as shown in Fig 1b.
Smartworld.asia 15

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

If the added element ia a branch, p-q, then the new bus impedance matrix would be
of order m+1, and the analysis is confined to finding only the elements of the new row and
column (corresponding to bus-q) introduced into the original matrix. If the added element
ia a link, p-q, then the new bus impedance matrix will remain unaltered with regard to its
order. However, all the elements of the original matrix are updated to take account of the
effect of the link added.

ADDITION OF A BRANCH
Consider now the performance equation of the network in impedance form with the added
branch p-q, given by

It is assumed that the added branch p-q is mutually coupled with some elements of the
partial network and since the network has bilateral passive elements only, we have

Vector ypq-rs is not equal to zero and Zij= Zji " i,j=1,2,…m,q
(12)

To find Zqi:
The elements of last row-q and last column-q are determined by injecting a current of 1.0
pu at the bus-i and measuring the voltage of the bus-q with respect to the reference bus-0,
as shown in Fig.2. Since all other bus currents are zero, we have from (11) that

Ek = Zki Ii = Zki " k = 1, 2,…i.…...p,….m, q

(13)
Hence, Eq = Zqi ; Ep = Zpi ………

Also, Eq=Ep -vpq ; so that Zqi = Zpi - vpq " i =1, 2,…i.…...p,….m, _q
(14)

To find vpq:
In terms of the primitive admittances and voltages across the elements, the current through
the elements is given by
Smartworld.asia 16

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Fig.2 Calculation for Zqi

Smartworld.asia 17

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Smartworld.asia 18

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Special Cases
The following special cases of analysis concerning ZBUS building can be considered with
respect to the addition of branch to a p-network.
Smartworld.asia 19

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

ADDITION OF A LINK
Consider now the performance equation of the network in impedance form with the added
link p-l, (p-l being a fictitious branch and l being a fictitious node) given by

It is assumed that the added branch p-q is mutually coupled with some elements of
the partial network and since the network has bilateral passive elements only, we have

To find Zli:
The elements of last row-l and last column-l are determined by injecting a current of 1.0 pu
at the bus-i and measuring the voltage of the bus-q with respect to the reference bus-0, as
shown in Fig.3. Further, the current in the added element is made zero by connecting a
voltage source, el in series with element p-q, as shown. Since all other bus currents are
zero, we have from (25) that
Smartworld.asia 20

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

To find vpq:
In terms of the primitive admittances and voltages across the elements, the current through
the elements is given by
Smartworld.asia 21

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Smartworld.asia 22

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

From (39), it is thus observed that, when a link is added to a ref. bus, then the situation is
similar to adding a branch to a fictitious bus and hence the following steps are followed:
Smartworld.asia 23

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

1.The element is added similar to addition of a branch (case-b) to obtain the new matrix of order m+1.
2.The extra fictitious node, l is eliminated using the node elimination algorithm.

Case (d): If there is no mutual coupling, then elements of pq rs y , are zero. Further, if p is
not the reference node, then

2.6 MODIFICATION OF ZBUS FOR NETWORK CHANGES

An element which is not coupled to any other element can be removed easily. The Zbus is
modified as explained in sections above, by adding in parallel with the element (to
be removed), a link whose impedance is equal to the negative of the impedance of
the element to be removed. Similarly, the impedance value of an element which is not
coupled to any other element can be changed easily. The Zbus is modified again as
explained in sections above, by adding in parallel with the element (whose
impedance is to be changed), a link element of impedance value chosen such that
the parallel equivalent impedance is equal to the desired value of impedance. When
mutually coupled elements are removed, the Zbus is modified by introducing appropriate
changes in the bus currents of the original network to reflect the changes introduced
due to the removal of the elements.

Examples on ZBUS building

Example 1: For the positive sequence network data shown in table below, obtain ZBUS
by building procedure.

Solution:
The given network is as shown below with the data marked on it. Assume the elements to
be added as per the given sequence: 0-1, 0-3, 1-2, and 2-3.
Smartworld.asia 24

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Fig. E1: Example System

Consider building ZBUS as per the various stages of building through the consideration of
the corresponding partial networks as under:
Step-1: Add element–1 of impedance 0.25 pu from the external node-1 (q=1) to internal
ref. node-0 (p=0). (Case-a), as shown in the partial network;

Step-2: Add element–2 of impedance 0.2 pu from the external node-3 (q=3) to internal ref.
node-0 (p=0). (Case-a), as shown in the partial network;
Smartworld.asia 25

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Step-3: Add element–3 of impedance 0.08 pu from the external node-2 (q=2) to internal node- 1
(p=1). (Case-b), as shown in the partial network;

Step-4: Add element–4 of impedance 0.06 pu between the two internal nodes, node-2
(p=2) to node-3 (q=3). (Case-d), as shown in the partial network;
Smartworld.asia 26

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

The fictitious node l is eliminated further to arrive at the final impedance matrix as under:
Smartworld.asia 27

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Smartworld.asia 28

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Smartworld.asia 29

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Solution: The specified system is considered with the reference node denoted by node-0.
By its inspection, we can obtain the bus impedance matrix by building procedure
by following the steps through the p-networks as under:
Step1: Add branch 1 between node 1 and reference node. (q =1, p = 0)

Step2: Add branch 2, between node 2 and reference node. (q = 2, p = 0).

Smartworld.asia 30

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Step3: Add branch 3, between node 1 and node 3 (p = 1, q = 3)

Step 4: Add element 4, which is a link between node 1 and node 2. (p = 1, q = 2)

Smartworld.asia 31

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71

Now the extra node-l has to be eliminated to obtain the new matrix of step-4, using the
algorithmic relation:

Step 5: Add link between node 2 and node 3 (p = 2, q=3)

Smartworld.asia 32

COMPUTER TECHNIQUES IN POWER SYSTEMS (CTPS) 10EE71