Network Matrices
Network Matrices
Motrites
i/
1.T INTRODUCTION
Graphs are very useful in the slveral fields like engineering, physical and social, etc. Many
applications of several electrical components such as machines and power system component
characteristics are representing in a simple way in graph form and for analysis of electrical circuits
also it plays very important role. For small circuit analysis based on nodal and meshed equation
methods by using KirchhofT's law and Ohm's law are sufficient. But for complex networks these
methods are difficult and take more time for solving the equations. In this chapter brief discussions on
graph theory and the applications of graph theory in power system networks are going to be presented
in detail.
t.2
DEFINITIOI{S
Graph Theory
When the e-l-e$g-4lllike resistqrs, inductors,-capacitors and voltage sources [shown in Fig. 1.1(a)] in
a nerwork are ieffied by lines. This type of network is called the 'graph' is shown in Fig. 1.1(D) and
the line segments are joined by means of nodes. The rank of the graph is 'n- 1 ' , where r is number of
nodes of the graph. The graph thus obta\ned is also known as undirected graph. While drawing graph
series elements can be replaced by a single edge in the graph.
Q
Fig. f.f(a)
Netwwh
Fig. f .f (b)
Equivnlcnt
grqh
Elffiical Pouer
Silstem Analgsls
(hiented Giaph
srapn whose branches are oriented is called oriented graph and is shown in Fig. 1.2.
It is also called
as directed graph.
Node
Tlre meeting point ol'the two or more elements in the graph
is called as .node, and denoted by ,n,
is also called as vertex.
.It
Element (Edge)
An element is a line segment representing one hetwork element
or a combination of
connected
Ex. :
'elements
nodes
n = 2,
Nunrber of elements e : 3.
Number of
Sub-graph
It is a subset of branches and nodes of a graph. The sub-graph
is said to be proper
strictly less than all the branches and nodes oi the graph.
if it
consists
of
Tree
i\
-' '
I Tree is a sub-graph containing ail the vertices of the originar graph.
)
i 2. Tree is a connecred graph.
1 3. Tree does nor conraining anyloop. ,
\ 4. Every connected graph has at least one tree.
rree has (n - 1) branches and rank is also (z _ 1).
\ l. !*h
,n-. elemenrs in the spanning tree are called branches or hyigs.
\9:
,6, :
the number of
\grefore
tree branches
1n
_ l).
Potuer Sgstem
Nefitork Mafrices 3
Cotree
It is a sub-graph formed with all the links of the graph or, in other words co-tree is a complement of
a tree. The number
:
D:
n:
where e
orunk@
: e - (n - l),.
number of elements
y =
-rrr b
-<->A
number ofnodes
Twigs
These are the branches of a tree.
Links
The elements that are not on a tree or elements of the co-tree are called links or chords. The number
oflinksisrepresentedbyLNumberoflinks,tmfl
where e : numbei of elements
n : number ofnodes
Gut Set
Tle.set
A fundamental tie.set of a graph with respect to a tree is a
forrned
one link associated
rith other twigs.- since for eaqh link of the tree their coriesponaing ro i
, the
ntmber of fundamental loops is equal to the number of links in the given tree. Number of fundamental
loqsorlinks, l:e-n+l/
rfiere e : number of elements of graph,
n = number of nodes of
L:I
TYPES OF
l.
a graph.
MATRI.CES
incidence matrix [A']
[A]
t3.1
E
-i
ircidence of elements to nodes in a connected graph is given by element node incidence matrix
is derioted Ly A'.
ai : l,If
the
l$X$om
theT'fr node.
z=
@o
era'@ O
l [l
r
:lr
zl
A':
-t---
lo
r lo
610
00
-1
-l
o
o
_0_
o
0
_1
-1 0
I -t
I -t
,..3.2
Any node ofa connected graph can be selected as the reference node. Then the uariable ofthe other
nodes, referred to as buses, can be measured with respect to the assigned reference(The matrix obtained
from the element-incidence matrix (A) by eliminating the column corresponding tb the reference no@
is the bus incidence matrix 'A'r7The order of the matrix is [e x (r - 1)] and fte rank is (n
Selecting node (0) as reference node in the graph shown in Fig. 1.3.
elbus
@O O
,[-r 0
-l
ol
ol
5l
=(*)
io -?-+l
r -rl
6L
o r
-r.l
2l o
A_
where 4.6
;i
l-- r
00-l
Ar:10 -1 0l
Io 0 -rl
I
- 1).
Al
o,:
1.3.3
-1
I
lo
[or
jl
The branch path incidence matrix shows the incidence of branches to paths in a tree, where a Path is
tode.
oriented from a bus to the
refere
K,
: l, if the re branch is in the path from theTth bus to reference and is oriented in the
same direction.
Ku =
'
K,
1,
if
the ifr branch is in the path from theT'fr bus to reference and is oriented in
reference.
The branch path incidence matrix associated with the tree shown in
as
Fig. 1.4 is
C @ O
l[-1 o ol
branch/path
o -r ol
sL o o -r.l
r=21
1)
I : 3 f4,5,61
b:3 Il,2,3l
Ite branch path incidence matrix and the sub TatrixArrelate
thanches to pattrp and branch6b to bu$es, respectively. Since
A6I{ :
KT :
ft
U
Aa-l
Fig. 1.4
.
groups,
".
: 1,
rorrornF
elb a b
rf 10ol
'::rtl+;l
s'lo -1 tl
u L o -1
Fig.
1l
1.5
bc
1[
001
I
0
2lo
3l o
':r[- -r
I
where U,
oL
-1
0l
1l
I
0l
t;:]
1l
rl
(r o o)
Io
B,
r ol
[o ot)
IJl:l
( 0 -1
1)
ll
i
il'
oE.,
BtAtr:At
Bl = Al Ar-l
Br = Al Kr lsince Ar-1
135
11r,
H*:",li::::::..r:::l::*-,u,.o,,sinini'onrv.od.rink:,fi;:,.ffiJ$Htrrr
[::]I:i,H,,*ff:ff9:S],*,,::::,I1" ""_;iil":t,:,,1",ff i::ji[:li::fi,il,1:#i:
-r.6
;1X,,1:':::.:':'i:::_1'_1;"ilr;ffi;**.Hd}l;l:tT-:"1H:i:ffJ'J:i?-,ffJffxi.T;f
rb '8" is a square marix of size (e x e). The B, ,ut.i*
Basic
ele
I
2
3
r-
4
5
6
7
re
cut-set
a bc
le f
r 0 0t0l 00
o r o oi 00
0 o t,oi 00
o o o. rl 00
-------------t
is given berow.-,,
6o
0'
0
ol
ol
tJb i o
0 -l 1 I 100 =----B;----l--u,-l I 0 0 010
0 -l I 0 001
Fig.
1.6
HHfili:g.""t
!b
,".ir*.
fie sets
:
the erement 'j', is in basic loop
J, and their directions coincide.
',, : -'. l, when
-,_n., the erement 'i' is in basic
,j,
loop
andtheir directions do not coincide.
: 0, when the element is not in theTth
basic loop.
e/l
-1
-1
-T
4
5
Ly. The
-l
qi given below
()^(
-t
=f
cb
U,
I
Fig. 1.7
where
C,
(0
0\
",:l-r o
[-,
ll
U,
rl I
U7:10
0l
[o o
1)
L.9.7
oJ
.cr,
.u,,, where
and
the rows
of ,c6, correspond to
*:"1|:l:'-:.rj::f^Li::T:",,:d
;;;"h*,;;rffiffiffi;*ffi:
This matrix
C'for
loops
a b c d,,
Open
ele
I
2
C':
4
5
6
7
basic loops
fg
1000
010
0100
1 -l I
0010 -1 0 -1 _lu,
.,
0001 -1 0 0 ----------L
0
0 0 0i 100
i....u;
0000
010
0000
001
l'
D
Fig. 1.8
7..4
['
[admittance
form.
Matices 9
To devglop the net{ork matrices the effect of interconnection between the elements are included
by suitable transformation.
1.5 NETWORK
MATRICES
The mathematical model of the netwqrks can be developed in three different forms and these are
1.5.1 &s
of Reference
Frame
The bus current and voltage vector equations of a network can be written
:
r*
(n-l)xl
:
[V] ,,,
[I]
(n-l)xl
[Y]
[Z]
ru,
(r-l)x(n-l)
[V]
,u,
[I]
(,r-l)x(,r-1)
(z-l)xl
",.
"*
(n-1)xl
as
(Admittance
(Impedance
/
form) /
form) ,r/
,/
/r...(l.L)
...(t.Z)
Il
l2
Tbre
[I] ,r,
(n-l)xl
ln
-t
v,
Y2
[V]
,*
(n-l)xl
[Y] ,,,
,*
tn-l)x(n-l)
[ZJ
ln-t)x0,-l)
Grnri&r
z/
./
Fig. 1.9
-,
.-
1O
,,/
Yru.:
(Y,, Y,,
Yrr)
["r, Y,
Y,
vu)
IY, Y,
z" z")
The impedance or admittance element on principal diagonal elements are called driving point
impedance or admittance of bus and the off diagonal elements are called transfer impedance or
admittance of the bus.
L.5.2
Branch Frame
of
Reference
[I] n,
(n-r)xr
[v]
,.
[Y]
= lzl
(,r-r)xr
Fl
".
(,-t)x(,-t)
,.
(n-r)xr
(Impedance form)
lrl ,,
B,
(Admittance form)
...(1.3)
...(1.4)
(,-r)*(,,-r) (n-r)xr
where [t] ,,
,,
Branch admittance
{n-l)xl
[V]
lYl
Lz)
1.5.3
(r-l)xl
(n-l)x(rr-l)
',
u,
(n-l)x(n-1)
= Branch
Loop Frame
of
{$"}i.
impedance matrix
Reference
The following equations are written for loop currents and loop voltages
[I]
'*,
c-(n-l)xl
: lZ) ,,,oo
[v] -",
e-(n-t)xt
where
[I] *",
[Y] r_ooo
(,
"- -
r) x
[V]
e-(r - r)
e-(n-l)xl
[v] -",
e-(n-l)xl
[Y]
lz)
*",
c-(n-l)xe-ln-l)
^"n
e-(n-l)re-(n-l)
*,0
e-
(a
-l)x
(Admittance
form)
...(1.5)
(Impedance
form)
...(1.6)
tI]**
e-(a-1)xl
1.6
Mafiires
11
There are two types of representation for primitive nefworks and they are
1. Impedance form
2. Admittance form
1.6.1
lmpedance Form
Consider the network having two nodes 'a' and'D' is shown in Fig. 1.10, the equations of primitive
network in impedance form can be written as
Fig. I.Io
vn6:
en* eny-Za;ioy:
o- b * enu:
Zo6in6
vab+e(tb:Zabinb
,qs:lz)i
rrhre
vou =
eou:
la6 :
...(1.7)
b'
L6.2
Admittance Form
Cmsider tire networt shown in Fig. 1.11, the equations of primitive network in admittance form can
be written as
...>
Fig.
iot
* joo: labvab
t+j:[Y]v
rrbre jn, yr6 :
I.ll
...(1.t)
D.
lF
12
7..7
1.
(a)
2.
1.8
By using singular transformation, we can derive bus, branch and loop impedance matrix as well
admittance matrix for the primitive netwok.
1.8.1
as
The bus impedance matrix Zsu, and bus admittance matrix Yso. coo be determined by using the bus
incidence matrix 'A' to related variable parameters of the primitive network quantities of the interconnected network.
i+i:$lv
...(1.e)
Ar
e'[Y] v
Ari + At,/:
'*- According to Kirchhoff's current law the algebraic
" '(1'10)
sum of currents meets at any node is equal to
zeto.
A'./ :
Ar i
: 0
...(1.11)
It is a column vector
AT,/ : Is*
Substituting the equations (1.11) and (1.12) in equation (1.10), we get
: At [Y]
t'
Power into the network : [I*sur] V"u,
...(1.13)
IBu,
Therefore, [.
srr]T VBu,
.. .(1.12)
U-]t
, ]
...(1.14)
as
: [I*rr.]'
But A is a real matrix so A* : A,
From matrix property [Ar]r : A
[A']*r U*lt
...(1.ls)
[I.'u']'
: A[i.]: $
...(1.16)
;{ vBus : v
the'V'from equation (1.17) in equation (1.13)
...(1.17)
: e' Dl A vso.
.. .(1.18)
[Ysur]
At [y] e
.. .(1.1e)
[YsuJ-l
" ,...(1.20)
{Ar D] A}-1
1.8.2
i+i:[y]V
..
.(r.21)
'Br'
Bri+B'"/:BtDlv
According to Kirchhoff's current law (the algebraic sum of currents at any node is equal to zero)
Br I
sum of currents passing through the elements that are connected to basic
cut-set
BTi :Q
BTJ
...(r.23)
column vector
BTJ :
...(1.24)
IS,
Isr:BrDlv
..
.(r.2s)
Power into the network is given by (U-srlT Vsr) and this is equal to the sum of powers in the
primitive network, i.r., U"l' v. Since power is invariant.
Power in the primitive network
[I-sJr VB. :
[l-]''
...(r.26)
'B'
[Br]r
(...
BrDlv
e})
...(1.27)
B,
[I*nr]r
...(1.2E)
B U*lr
BVsr:v
Finally substituting 'v : B Vsr' from equation (I.29),
...(1.29)
in eqn. (1.25)
Is,
Br [y] B Vs.
...(1.30)
lYe.l
...(1.31)
: g'Dl n
After calculating l[Yrr]' next from this expression we can calculate ,lzsrl,
i.e.,
tZs,l : [ysJ-t : {Br D] B}-t
1.8.3
..
.(1.32)
...(1.33)
The loop impedance matrix^'-Zruor' and loop admittance matrix 'Yloop' are to be determined by using
the bus incidence matrix 'C' to relate variable parameters of *re p-iirlitive network quantities of thc
inter-connected network.
v+e:lzli
Pre-multiplying the both sides with
'Cr'
Crv+ w
Cre:
e: \cr[z]i
tzl r
...(1.
According to Kirchhoff's voltage law (the algebraic sum of voltage in a closed loop is equa
equal
zero)
:
cr e :
v,-oop :
Cr v
[Cr]
It is a column vector
: cr lzl t
From power invariance condition for the loop and the primitive networks is given by
VLo,,p' and this is equal to the power in the primitive network, i.e.,,i*r e, .
Power in the primitive network = powr in the inter-connected network
ttl*lt vl-p :
[i"lr e
lClr
'
.
lll,,orl' [Clr e: [i*]r ,
Eliminating 'e' and taking transpose of above equation, it is modified
i : [C*]r [Ir_oop]
But 'C' is a real matrix, C* : C,
i: 1C1a1l*or.;
Fromrthe equations (1.35), (t.37) and (1.41)
vl-p : tCrl tel [C] Ir.*p
The loop frame reference of impedance form is
as
,[Ii*p]r
...(1.44)
This is given by
[Yr_oop]
1.9
[Zr_oop]-l
By using non-singular transformation we can determine branch and loop impedance matrix and
admittance matrix for the primitive network. But in this section, we discuss about the branch
impedance and admittance matrices only.
1,9.1
Consider the augmented incidence matrix, the augmented network is obtained by connecting a
fictitious branch in series with each link of the original network.
Fictitious node
Fig. l.12
The admittance of each fictitious branch cannot allow altering inter-connected network, its
admittance is set to zero. The current source of fictitious branch carries the same current as the
current source ofthe link so that the voltage across the fictitious branch is zero. A tie cut-set, can be
treated as a fictitious branch in series with cut-set containing a link.
From the branch frame reference form of performance equation
lln,l
...(1.4s)
[YnJ [VsJ
r+i;tJlV
as
...(1.46)
lBlr, + tBlri :
...(r.47')
[B']r Dl v
ol
n,:fU' url
We know,
LB,
[';
]1lt?1.[? l:][f]
But
[? fl] ,, ,,
Iru, + t_B.l
L
[UD] iD
.l
: i6,U1it:
it
...(1.4r)
...(1.4e)
16
IUalit = ju,Urit: jr
Substituting these values in equation (1.49)
L ,, I L
wlrere
i,'
):
+ Bf i, : [Br] i = 0
ir, + Bf ,it: [Br1i = Ir,
...[1.s1 (a)I
...t1.s1 (D)l
ib
:
[;].[?] [? ";] ,,,,
:
[,T;] [? fl] ,, '",
I ln, I
...(1.52)
1,,*r;l:'u'
where
[,,,]
[?
'ul] ,,ru,
i, + j, is the total source currents of a fictitious branch and its associated link.
Is,
[Br] DI tv1
and voltage across fictitious branch is zero. So the voltage vector of the augmented network is Vs.
V:
[B] [Vsr]
IB'1 [VB,]
Ie.
(v*
comparing equarions,,
.:;,
[Yr,J
;!",T)
: tB]r t vl tBrl
yal [u,
y,.]
l
Ls, u,j
lu') :Primitive
admittance matrix
- : fy'
lfu, lu )
Itu,l : Primitive admittance matrix formed by branches
Dtl : Primitive admittance matrix formed by links
D1
Iyrl : D,r]' :
Yrl:
[Yo
1"" ",.1
I yuo
- [[rr,
Yrl
Lv.
L
e,:
!ur, + Bf yu
lut + BrrY,
Ys:
Yc=lt*)z'B
trt .llt,
I ,*
[Yo v"l
Matrices 17
BT y,u + lnt Bt +
Bf n,
yn+ruB
I
u,l
...(1.63)
..(1.64)
...(1.6s)
...(1.66)
'.
Yo=)a
But from singular transformation method,
[Ys,1
: [u,
,r][;; i;][::]
= ltoo+ BI vra
)ar +
BI ,rt
[]]
...(1.67)
LlO
..(1.68)
...(1.6e)
By direct inspection of the network, Yru. can be obtained for any network,
if
there is no mutual
Apply the Kirchhoff's current law at every bus for developing the bus admittance matrix. In this
nodal equations are developed for every node except for the reference bus, which is
oormally taken as ground bus. Let us write the nodal equations using Kirchhoff s current law for the
oetwork shown in Fig. 1.13.
.ay, iy.t"matic
Fig. l.13
18
Electrica| power
Here
'I,'
Analysi.s
'Ir'
and
are the extemal current sources at the bus '1 and
3'. In the nodal formulation,
the voltage sources with the series impedance, which
is usuaily the case in the power system netwo
(l) Ee : l,Z,
(ii) Zo:7r
zs
zL
VL
Fig.
l.l4
Fig.
l.l5
ldeal cuwent
source
1,2
and3. We
: Vr )r + (Vr -Y) yn
0 : V, lz + (Yz- V3))zr + (Vz -yt)yn
Is : Vr): + (Vl -yz)yzs
Ir
ylttt
'0'
: lii. i'e.,!tz:
The admittances)ii
Let
...11.71
t.e.,
nodes.
yr2 =
Ir = Yrr Vl + yt2 V2
0:Yz,Vt+yr2V2+y23V3
lr
Y:tz V2
+ y33 V3
_;:T.,;l::"
".*
T:,_T?;:1"
IoI:l"r, Y, r, llv,
*
...(1.74)
From the,above discussions we can write the 'Ysu.' general form for any power system network
with'n'
buses (n
1 nodes) as
follows
Y,,,-l
I ,,
v,,, I lr,
I 1",, Y,,
[v,l
I
:
Y, :
Y1;
...(1.7s)
Sum of the admittances of the elements that are creating the node at bus
'i'
and
'i'
J'
...(t.76)
Itbte
,I 'I'I
In this method the elements of loop incidence matrix (Z1oor) can be calculated directly by inspection
md hence 'ZLuop' has direct correspondence with the given primitive network.
I-et us take the one example for solving 'ZLoop'by using direct inspection method.
The elements of 'Z.oor' matrix are developed by applying Kirchhoff's voltage law and writing
bop equations of the given power system network. However if there is any current sources in the
retwork that is replaced by equivalent voltage source with series impedance.
n
ll
l2
Fig. l.16
E2-\:
0:
Separating
...U.77(all
(Iz
...tL.77(bfl
...tt.77(c)l
Zrt:
Zt + Zz +
Z',4
Zzz:h+23+Zs
Zts: Zq + Zs + 26
Zo:Zzr--22
Zn:Ztr--24
Zzs:Zzz--Zs
The resultant loop voltage sources in loop
.l'
is
V1:E1-E2
The resultant loop voltage sources in loop .2' is
yz:Ft_Et
2,, ,"llr,l
lr,l:
lr,,
o
z* z")ltr)
Lz,
2,,
l',, z*
. lloon'7 - lzrt
1...
Lr,, znz
r'
z,,f
zr,l
...(1.
I
2,,)
sowED PROBLEMS
hoblem
l.l.
I.l7
Ai A, B: B, C', C, K
o+
J)
Fig. r.r7
Sol. For Fig.
1.17(a)
Numberofelements, e:9
Numberof nodes, n:5
+ l:6/
,/
Numberofbranches,b:5
Number of links, I : 4
fi,,,r
a/1L
@
Fig.
I.l7 (a)
Graph
ry29
/*fr'*c'd)
Lu- ntol,r/ /t
,, @
vfiuou,n "(,_7
Element node incidence matrix (A') elements can be obtained from Fig. l.l7 (a) as follows
ai : l, if the id' element is incidence and oriented away from the j6-node.
ou : - 1, if the ith element is incidence and oriented towards tne;m-i"Oqe.
oi : 0, if the ith element is not incidence to the je node.
Node
2
J
4
A':
6
7
8
'1
.-1 0
0 1 -1
100
100
000
000
001
001
000
00
00
10
0 -1
01
11
10
00
10
0
0
0
0
1
0
0
1
1
For obtaining bus incidence matrix (A), eliminate the reference node column in A'.
Bus incidence matrix (A)
@o
Element
-1
[:
,5
5I
6I
7|
8I
9|
0
0
0
0
0
0000
-1 0 0 0
0 -1 0 0
0 0 :[ 0
0 0 I -t
0 -1 1 0
1 -1 0 0
1 0 0 -l
0 1 0 -t
@Fig.
l.I7 (b)
Tree
Branch path incidenle-qatlix (K) elements are obtiined from Fig. 1.17 (D).
Puh
Branch
I
2
K_
4
5
-1
0
0
0
0
-1
-1
0
0
0
0
0
-1
0
0
0 0
0 0
0 0
-1 -1
0 -l
11
l.Ll (c)
,r'
) \,'
f,
Fig.
f.f7 (c)
Cut-set
B, - 1, if the ith element is incidence to and oriented in the same direction as the/ basic cut-set
B, : - l. if the lth element is incidence to and oriented in the opposite direction as theT'fr basic cut-set
B, : 0, if the ift element is not incidence with theTs basic cut-set
Cut
rll
2l0
0 0
1 0
310 0 I
4l0
slo
610
0 0
0 0
0 1-1
7 l-t -1 I
8 l-1 -1 0
910 0 -1
Augmented cut-set matrix
tj
(B)
Cut-set
Element
A B C,
lll
0 0
2l0
1 0
310 0 1
B':
4l0
0
5|o o
610 0
7 l-t -1
D
0
0
0
1
1-1
1 0
8l-1 -1 0
9 I 0 0 -t
Elr
oiO
010
010
-4
ta'
0
0
010 0
liO
0
--+0
100
0
010
001
000
0
0
0
1
!, : ;
I 9, 5, 4,3
H L,2,8,5,
F 3, 4,6
-+
-+
link
link
6 as link
9 as
8 as
Fig.
r.l7
(d)
24
't
2
c-
4
5
6
7
8
FGHI
0110
0110
-l -l 0 I
I 0 -1 _l
0 0 -l -1
1000
0100
0010
0001
c D El. c H
{ 0 0 0i0 I 1
fl
t',;'.
u'
\
-1\
\ Cb \
( t2Yuo)
(,' -\-O
\-/
llt
210
I 0 0 0i0 1 I
3 J0 0 I 0 o l_r _l 0
r
0
0
tlo ,o o o olo i o
8,1
0 o 0 0 0lo
elo
'
r.r7 (a
0 0 0 0i0
0 I
0 0
o
0
20t60"A
jl0
j10
+j5
+j5
i*pra"irri;;;.;:.
+ j20
+ jZO
20 230" A
Fig.
l.I9
(a) Graph
Fig.
n:5
elements, e : 8
Numberoftreebranches, b: n- 1:5 -l:4
Number of nodes,
Number of
l=e-n*l:8-5+l:4
Number of links,
:
Y, :
Y,,
For
as follows:
Sum of the admittances of the elements that are creating the node at bus
i,7 =
1.
2,3
'i'
arrd'j'
and 4
Diagonal elements'.
,"
t.
tz
Yr3
Yr4
:
:
:
Y2r
Ygr
Y4r
:
:
:
- 70.1 p.u.
0.0 p.u.
-7O.05 p.u.
Y23:Y1,2:-j0.2p.u.
Yzq:Y+z:0p.u.
Yl+:Yar:-j0.05p.u.
i0"J5 ptu'
'i'
26
ElectricalPouerSystemAnalysls
0 - j0.05
I j0.25 - j0.1
0
| -;o I jo.s - j0.2
rBu':l
j0.3s - j0.05
-jo.z
l-;o.os
j0.05
i0.1s
Problem 1.3. For problem 1.2, determine the elements of 'Zurp' by direct inspection methdSol. Here we have to replace the current sources into equivalent voltage sources when applying
direct inspection method.
The elements of loop impedance matrix as follows
:
2,7 :
2,,
,i, ad,
Z,:
1725 p.u.
Zn: Ztt:
Zu: Zq:
Zzt : Ztz = Z+z:
Zy = Zq:
Zz+
0 p.u.
jlO p.u.
-710 p.u.
- j5 p.u.
- j20 p.u.
l+1zs -js
.7
-js +j2o -jro
aloop _l
I 0 -ilO +i50
L-j10 -js -j20
jl0l
_rsl
j20l
+ jss_l
(i) ct -_- BI i
(iii) At) { : U and
(ii)
B,T = U
c,B,T:
t
r,fi C,
(iv) B,
B,:: Ar
A,I{
{
Fig. l.2o
!
-|
:4-I=3
l:e,-n*l
:4-4 * 1:1.
Number of links,
Fig. f.20
-l
A-
,)
-1
o ol
eu:l|--r
0 -t 0l
I o I -r.l
A,:[l 0
(a)
Grapb
-1 l^,
--- )A,
-1
-1]
o@
K-
0
0
2
3
Fig. I.2O
(b)
Tree
-t -l
0 -1
ABC
I
-l
4
I-r
,r:lo
lo
Br: [- ll
I
0
1
tl
rI
0t
o fs,
rJ
I )8,
28 ElectrimlPower
SgstentAnafusis
A B C IN
1
B':
2
3
o olo
o 1 or6:[*]+]
o o 1lo
B,=[-111]
U,:
and
[lJ
c-t>
C:
2
3
-1
-1
l:
)c,
--A-\
I-'11
c, =l-tl
Fig. r.20
L-il
and
C,
= [1]
A B C IO
10011
0 l-r
o r i__l-r
000;1
.,:i-il
Verification
(i) Ci,--B1
From the matrices C, and B, r,alues
Ca:-BlT
cal
I
-iua
-LT-TI[]
(e)
(ii) c'B'T: u
00
10
01
00 il
100
010 :l
001
:l
1il
C':
B':
l-1
0 0 -ll
,":l: ;:
ll
Looo,l
l-1 0 0 lll-l
-r.l
tl
tl
_lll: ; r
;i
lo o o lllo 0rl
.,,rr':ll
[r o o ol
:ttlo 1 o ol _U
lo o r ol
Lr o o ,l
C'(B)T _ U
(iii) AbKr: u
[-r o ol
Ar:l o -l ol
I o r -rl
:fi
":fi ; -j]
-i l]
A' c:fi
I :]fi -i l]
=*
ElectricolPower
temAnalgsis
:[i
001
0l
0 r.l
,4,6KT: U
= ArKr
(iv) Br
A,:[t 0 _t]
[-r o
x':lo| -t
L
0 _l
ofl
I
0l
_l_l
[-t o ol
l--rl
riiit
A6I{:U_
ir: - BI
Gi)
n-l
b:4-l
-3
=e-n*I
:5-4*l:2
Numberoflinks
Bt:At{
(iv) c,(B)r
: s a(
Eig.
A_
From Fig.
l.2l
Grapb
I^,
[-r o ot
Ar:lo o _ll
and
l.2l
)o,
e6
r -r ,]
l-r 0 -11
o':1,
-r il
Fig.
I.2l
(a)
Tree
(:
001
0 -1
From Fig.
ABC
B-
0'r
lJ
-r
(B)
0Llr,
0 ir,
I )'
-l
I ol
'.:l
Br:lt--1
:
1 1 -r r.l
From Fig.
l.2l (b).Augmented
I
0
0
- I -I
B':
4
a
J
Fig.r.2l(b)
Matires
C IO
0 010
1 010
0 I l0
I --0-T-l-1 I I
lurlol
- Lnr lurj
_ l-J-l
l--l I 0l
s,:Ll
_l tl
From Fig.
(C)
1",
},,
.":
-'From Fig.
[-l_il
l-l
Fig.
L-;
r.2I
(c)
31
:[u,o lcrl
I
Verification
(i) AaKT:
l--
001
er:10 o -rl
Ir -t
[-r o ol
-rl
-l ol=xt:l o -r ol
o-rl L-r o-,1
o
[-r
K:10
L0
[- r
ArxKT: |
o ol[-r o
-r
R.H.S.
Ar
0
: [r
l0 r
loo
Kr
[1 1
A,=l
'
L0
-1
-11
0l
[-r o
rt:l o -t
f-r
o
o
o -r l
-l--r o ol
[to -'ll
o
ol :[-l
[o -r olL_,-r
_rl
o
R.H.S.
(iii) cb--n/
_r, .
l0l l:B,
-1 lj
L.H.S.
l--l
B,:
' Lr
I
ol
o -,ll o
ol
-1 0lL-l 0 -tl
lr
(ii) Br:
ol
-l
r-1.l
L_; ll
Cb.
lur.]
(iv) C'(B')r
100
0 10
C': 001
000
000
I 00
0 10
(B')T
: 0
0I
1 -t
-1 I
0 I
1 0
0
-t I
I -1
1
0\
1 0
000
000
0
100 1-1
I
010-l
I
C'(B1T : 0 0 1'0
000
10
000 0 I
10000
01000
:10 0 I 0 0l:
1
I 00
0 l 0
001
000
000
U
-l
I -1
0
1 0
0 l
1
Unit matrix.
000r0
00001
Problem 1.6. The incidence matrix is given below. From that draw the oriented graph.
rO
Branches
nodes
AT:
@
@
@
2345
678
100
01001
0 *t I 0 0
0Jq
001
0 0 -1 I -l
000
1 0 0 -1 0
Sol.
Eig. 1.22
Fig, 1.23
Table 1.1
Element
Bus Code
Self impedance
inp.u.
0- I
0*2
0-3
0-4
I -2
2-3
3-4
1-3
2
3
4
5
6
7
8
^A,
0.1
0.2
0.25
0.5
0.1
0.4
0.3
0.6
is
1000
0100
0010
0001
A_
l -l 0 0
0 1 -l 0
0 0 I -l
I 0 -l 0
Primitive impedarce marrix is
Elementsr-+ I
2
J
2
3
4
5
T
8
0000000
00.2000000
0 00.25 0 0 0
0000.50000
o 0 0 0 0,1 0
000000.400
000'
0000.30
0 r0 0 0..00
/
.j
0.6
i
i
Foroer Sysffi"iYettuorft
Y:
v:
[zl-r
0J0
00.2
0 0
000
000
000
000
000
0
0
a.25
0.5
0 0.1
0 00.4
0 0 00.3
0 0 0 00.6
r0
I
i
05
004
0 002
y=
0 00010
0 000 0 2.s
0 000 0 0
00000001.67
YB,.: tArl DI tAI
100 00
3.33
0 0 0 0
05 00 0 0 0 0
00 40 0 0 0 0
00 02 0 0 0 0
IJ] [A] :
00 0010 0 0 0
00 00 0 2.5 0 0
00 00 0 0 3.33 0
00 00 0 0 0 t.67
10000
0s00
0040
0002
10 -10
0
0
0 +25 - 2.5 0
0 0 3.33 -3.33
+1.67 0 -1.67 0
100
010
001
000
1 -1
0
0
I
0
I -i
0
0
0 0 I -1
1 0 -l 0
IftfB
36
Elrcticalfuwer
yo
l0
00 I 0 0 1l
lo
I 0 0 -l
I 0 0l
tArl Dl [A] =
lo o I 0 0 -l I -11
Loo 0 I 0 0 -l ,l
l-1
50
04
00
-10
0
0
0
10
2.5
0
0
0
1.67
[(,0*lo+1.67)
:l
-ro
-r.ot
Lo
I zt.et
rBus
| -,0
- |
-r.u',
Lo
10
-3.33
0
0
,
0
-2.5
3.33
-3.33
-1.67
1.67
(s+ro+2.s) -z.s
- z.s (+ + z.s +3.33 +1.67)
- 10 - 1.67
t7 .5 - 2.5
0
0
-2.5
- 3.33
0 - 3.33 5.33
r2.5
koblem l.E. For the system shown in Fig. 1.24, construct yru,
method. The parameters of various erements ari given;rir;,;;;.;.
by singutar Tmnsforn
f;i;'*;'?;,}
Fig. 1.24
Table I.2
Element
r-2
t-6
2-4
z-J
3-4
4-5
5-6
,r{,;,]
Reactances in p.u.
0.u
0.6
4.03
0.02
0.8
0.06
0.05
uyirrn"r,
Sol.
Fig. 1.24
(t\
ELg,.
Oriented' grnPb
L.24 (P)
Tree
o@o@
I -1 0 0
1
0
0
0
0
0
A,=
4
5
6
7
0
1
I
0
00
0
0
-1
1
0
0
0 0
0 0 -1
-1 0 0
0 0 0
0 0
-l
l--_1 0
0 1 -1
deleting
Fromtheelementnodeincidencematrixbusincidencematrixcanbedetermined, i.e-,by
(6).
the row corresponding to reference node
Bus incidence matrix (A) is
e@o@o
1 I 1 -1 0 0
0
2l1
3 I O 1
{:
4 I o
s I 0
6 I 0
710
I -1 0
0 1 -1
0
0
0
0
0
0
0
0
0
I -1
0 I
o@o@@
I I -1 0 0 0
,-(-l
e
0 0
0 -1
\2/
I
o
0 0
0 o
211
zl1 o
0
1 -1
0 1
4 II o
4
-1 o
o
o
0
6 I o o o 1 -1
--3-T
s I 0
A, (Branch)
o -r o i Ar ( Link)
1' -1
-1 o
0
as
follows
gg
Elecffirr:rtfuu:er
j0.04
0 j0.06
0
0
000
j0.03
j0.02
0 j0.08
0 0
000
i0.06
i0.05
lzl-l
- jzs
0 - j16.67
00
- j33.33
00
0
- iso
00
0
0 - jtz.s
00
0
0
0 - jr6.67
00
0
0
0
0 _j2o
y:
11 0 0 0 00
-l
[A]T DJ
: -I 0
0
0
tArl DI
-J
[A]:
0
0
0
0
1 I
0 -1
-l 0
0 0
0 0
I 0
_1 I
0 _t
0
0
0
25
0 16.67
0 0
000
000
000
000
33.33
25 16.67
0
0
-25 0 33.33 50 0
0
0
00
0 - s0 t2.5
0
0
00
- 33.33 0 _ 125 16.67 0
00
0
0 0 _16.67 20
-,r
25 t667 0000
-25 0 33.33 s0 0
0
00
0 -50 125 0
00
-33.33 0 -12.5 16.67
00
0
0 0 _t6.67
50
0 12.5
0 0
000
0
0
0
0
20
1667
20
I -l 0 0
1000
0 I 0 -1
0 1 -1 0
0 0 I -tr
0 0 0 1_
0000
''
(zs + to.ot)
_25
YBr,
-,1
-zs
+::.r
(zs
+ so)
-50
0
0
33.33
- 25
108.33
00
-50
koblem
Fig.
.25
-33.33
-12.5
(33.33 +12.5 + 16.67)
12.5
16.67
16.67
(a.at + zo)
-3333
it
(so + rz.s)
4167 -25
0
50
0
0
-16.67
36.67
1.9. Determine the Ys^ matrix by SingatnrTransformntion methodfor the network shown
The parameters are given in Table t .3.
Table 1.3
Ele'ment
Bus Code
p-q
t-2(1)
2
3
3-4
4
5
Impedance
Zrr-*
0.2
0.4
t-3
r-s
1-2
(1)
Impedance
z*_r,
0.05
0.5
1-2(2)
0.25
2-4
0.2
Fig. I.25
: J
Numberofbranches, b:n- l:4-l
=3
Number of links,
l:e-nll:5-4*l:2
1-2 (1)
0.1
Anafusls
Element-node incidence matrix (A')
I -1
l0
00
1 -1
01
I
2
A'-
4
5
00
-1
tr -l
00
0 -1
-1
0
('.'
-l
0
0
-l
I
[:
Primitive impedance matrix [z)
0
-1
1 -l
0 0
0 -l
ele L
o,
o ol oI 0
0'2J
o: foos /o o.r
o
,loor@o
y:[z]-,:l 0 0 0.5 0
;
o -l
o
0
0.1 0 0 025.0
000002
To calculate
Method I :
al
0.2 0.05 0 0r
Y:
[2]-r :
0 -l
0.050.4 0 0 0
000.500
0.1 0 00250
000002
is reference
fuwa SgstemNetworkMaffies
Stcp 1. Interchange rows 3 and 4
0 0.1 0 l-t
0l
0.400
0 0025
00.50
000
J]
0.05
02
0.05
y'=
0.1
0
0
oe
0.0s 0.1 i
0 -l
0.4 0 i0
0.1 0 02si0
-0 ---0----0--l
I
0.0s
y"=
--:-----------l----
0
0
05--
0 0 0lo
02
oz o.os o.l I
0.4 o
Lo.r o o2sl
I
Al: lo.os
A2=
fool
roo
ol A,=lo
lo
LOOI
o-l
A,: [05 oz)
0l
,]
Lo
l- o.s - osr -zs1
A,-'
: | - o.r, 2.6
L -z.o 033
033
5.ol
Ant: 12 0l
L, rl
Step 4.
',-: h-l-11-,-l
La, ia;'l
65 -08r -2.6 0 0l
-o8l 26 0.33 o ol
t''= -26 033 5 o 0l
o o2 ol
o o
oos_l
[4, ierl
LAr iArl
41
42
E:leetir:"\ryunr SgsternAnalysis
-081
6.5
v':
2.6
0.81
-26
0.33
0.33 0
-2.6
02
00
0
0
6.5 *081
0.81 2.6
0 -2.6 0
0 0.33 0
y : [2-1] :
0
02
00
0.33
0
50
-2.6
0
00
05
Limitations : This method is applicable only the matrices
zero's only. Otherwise it is not applicable.
Method 2
A,
and
A,
02 0.05 0
0.05 0.4 0
000.5
---o---
y : [2-1] =
dl
000
0.1
00
0b
0.25 0
002
Let
s,l
[r,
[o, o,1-'
:
Lo, eol Lr, B*l
The values of matrices 81, 82, 83 and 84 are
Br
o*-,:
[o;"
;]
[o.r ol
[; I
e,:lo
- lo ,lol
A^:l l-0.1 0 0t
' L0 0 0l
A,Ao-,":
ltt
;] t;
0 -l
:lt'J
: 3l
[A, lArl-'
t ---F---
LA: i Aol
o ol
l, olIo o ol
Lo oJLo o ol
[o.o+ o ol
I o o ol
l-o o ol
I-o.a ol l-0.1
lAr - (Az
Rt'
oz
ll
a;-'
o.o5
[o.o+
o oll-'
L'f'T
l-
os
l-orr
Bt
J,j
- o.8r ol
2.6
Lo o
ol
z)
82: - B, A, A11
:;: :]
[,;r
l--
o.s 0.81 0l I- 04
L'f'
l-2.6
B2: lo:z+
Lo
:JL
ol
o
oJ
^ l-2.6 0.324 0l
&':Lo
, ol
B+:
Ao-'
- (e;' e, nr)
Lo
:t
",
:
l-0.4
-lo
_l
ol
: :]
B3:
.14
Ao-'At
tT :lr;
tT : :t[-i1 l]
-l - z.e ol
o ollorro
o oll o ol
ol
:l
Elrcticalkru:q
:l
l-- 1.04 0l
lo
o,l
Ba:A+1-(Atl
:[;
A3 82)
I i 00
1.04 0
!:z':Lr,
0 -2.6
0 0324
20
0 5.04
00
6.5 - 081
- 081 2.6
0 ,-0
-2.6 A324
00
B"l
.t _
[Bt
-r
I-s.04 0l
:lo
s]
Bnl
0
0
0
0
5
YBr. :
o o -l
rl - 0.81 2.6
- 2.6 0.33
h' -r I o 0l
Io 0 -l 0 -u
033
002
o.e +
=|
zs
0.81
o.8t
Lo
000
0.33
-2.6
-2
2.6
0.33
il
-l
l2
0.48
= lo.8l
-26
L0 o
I o.+
lBus a,
zBus
o.+a
L _,
- IYuur]-'
2.6
0.33
-2
T -l
- 0.48 - sl
4.6 -rl
-2
: {[Ar] tJI')IAI]-'
l- o.+ - 0.48 - sl
| - o.ot
4.6 -Zl
-'
.,
L
|-
lBus - I -
l-
o.zs
-2 ')
- 0.116 - 02081
0.,,u
o.rot
- 0.1e3 - 0.028
- 0.028 - o.ol4l
I
00
-l 0
I -l
00
0 -1
-l
1
0
1
-t
00
00
05
-t
l-
l0
0 -l 0
0t -l
10 0
10 -l
06 - 0.81 0 -2.6 0
0
0
-l
0
-l
Problem 1.10. Determine Ys^ matrix for problem 1.7 by direct inspection method.
Sol. Diagonal elements
1:
+ t.67 :21.67
" :l*l+
0l 0.1 06 10+ 10
I
y..:l*!+
z1 0.2 0.1 o.4 :5+10 t2.5:L7.5
I *!*l
y..=
:4,-2.s +3.33=9.83
0.4 0.3
025
'r
:2 + 3.33 = 5.33.
Ytr=
#.*
y,,
Off-diagonal elements
I
yr2:Yzt:-ut:-to
Yr3:Y3r:--#:
-1.67
Yla:Y+t:0
yzz:y32=-#:.
Y2+:
Yaz
r.t
L
Y3+:Yur=-0.3
-3'33
-10 -t.67 0 I
l-10 r7.5 -2.5 0
12r.67
V:l
'tsus
l.ll,
\'he network shown in Fig. 1.26. Draw graph and ffee. Determine the Yau, W
inspection method and verify Ysurby nodat equation analysis. The admittance values are given
koblem
*c6
ip.u-
quantities.
- jl0
20
z-60"
j10
-j5
-js
Fig. r.26
-i20
- j20
20
z-30"
ebmeatfuruerSgrstemArulysts
sol.
l
1
Diagonal elements
ofr-diagonal etemen*
Y2a=Ya-0
Yrc:Y+r:-(j20):j20
[-ioo iro o
-t;'
'lo
"*.: I
I izo o
j2o I
_'io,
j2o
,\l
- jso.l
- j10
j10
-j5
-j5
- j20
j20
20/-30.A
at
node@
V,
node@: V,
node @ : Y,
node@: Yn
Writing nodal equations for Fig. 1.26 (c)
At node@
- vr)
(- j10)
j10vr +Gjzo)v2+j5v::0
At node @
(Vr - Vz) (-
...(1.86)
At node
...(1.8s)
v' *
(-
i45\ v3 + i2o v+
...(1.87)
V2 (-
j10) +
(V+
Z-30'
20 Z- 30"
20
20
z-
30"
...(1.88)
Writing the equations (1.85), (1;86), (1.87) and (1.8S) in matrix form.
l:l
l^'l-[In .]
iqo
.iro
;,0
lo
jrO 0
- jzo js
js - j45 ;L I
0 j20 -TsoJ [v. ]
[Ysu*] [VsuJ
ilo o
ljro -jzo js
rBus-l
i+o
l-
_l
lil
"
izo
o
o js -j4s j2o
t"j20
0 j20 - iso
L
Problem 1.12. For the graph given inFig. 1.27, draw the tree and corresponding co-tree. Choose
a tree and hence write the basic cut-set schedule.
(April/may 2005,2ffi7)
Eig. 1.27
Sol. Tree of Fig. 1.27 is shown in Fig. 1.28(a)
7
Fig. 1.28(a)
Corresponding co-tree is shown in Fig. l.2$(b\
Fig. r.28(b)
Cut-set schedule:
---'-l-.'-o.----.
Fig. r.28(c)
ABCD
1000
1-1
0-11-1
0010
0001
0100
00-t0
00
h,oblem 1.13. For the givm network shown in Fig. I . 29, draw the graph and tree. Write the cut-set
(April2005)
dtcdule.
, fJ
Fig. l.3o(a)
dFig.
----?---
^v-----r----
@
Fig. r.3o(b)
etaregrtruwerslstenr
Cut-set schedule
A B CiO E
l
0
I
2
3
0
0
0 rio
-n-
0 -l
-l
0
0
o- 0 lio
-- --;1-1
0 0i0
I 0t0
li0
: U
4=At{
(iii)cb=-EI
(i)
(ii)
Ar,
Kr
I,
Fig.
Sol. Oriented graph of Fig.
l.3l
l.3l
Fig. 1.32(a)
Ai
't
Tree of Fig. 1.32(a) is shown in Fig. 1.32(b)
Fig. r32@)
Element node incidence matrix (A')
xo
[A',]
@@
-1 0
0-1
01
-1 ,0
-1 0
0
0
1
[A]
@o@
IAI=
4
5
-1 00
\
0-1
'ol'1
-1 00
0l
-l
lonl
@@
1
A:5
-l
0-1
-l 0
0l
o1
ol
0i
1l =[
_I
it]
52 turri.",fuug-esrananatysrs
H@iri&ncmatrix [K]
km Fig. 1.32(b)
@o
l [-l
r:zl o
rlo
-r
o
1l
,l
I
I
iI
i
{
Fig. r.32(c)
From Fig. 1.32(c), the basic cut-set matrix [B]
I
2
B-
5
3
ABC
100
010
001
=[*]
---:l
l--- r
100
I
'l
{
I
I
I
I
2
B,:
5
3
ABC
100
010
001
1-l-1
100
iI
I
I
I
DE
00
00
00
T---o
0l
tlt{
lll=l:i.
J,l
I
-----____l>
\D)
J
1
tl
l
I
I
Fis. r32(d)
132(4,
loops:
D : 2, 3, 5, 1, 3 as link
E : 1, 4, 4 as link
DE
I I -l I
2t I 0
C:51 I 0
3l I 0
4t 0
=[i:]
I
2
C'=
ABCDE
1 0 ol-l
0 l 0i1
I
-1
o
li
0!0
Iu, I cr-l
Lo iu'I
ool[-rool
[-r
,,:
l-o
L,
[-r
Cr:
II
Ir
*:
; rl:l'
Aa: I 0
[-r
-r
o '
At:
o.l
L-:
I-o t
[-, o
1l
ol
(i) AaKr: u
tl i :lti ;
:]:[i
(u) Bl = Al Kr
i: 0'
-'ll-[-r
o
0ll
'L-l
-r
0
ol
:l
:[,Ir
I
0
ol
ol:u
'l
-r -tll:B,
00_J '
:j
tl
o.J
54
ElecticolfuioerSystemAnalysls
(iii1 go -
-Bl
[-r
-r
-sI:l
, I r ol:",
[r
I
o_]
Problem 1.15- The graph shown in Fig. t .33, select@ as reference node and tree T
{2, 4,
Determine the incidence and augmented rnatrices. From these verify the
followings:
: 1,6r
(ii) Cb: - B!'
(iii) Br : - Ar Ail
(i)
B,
sol. Tree of Fig. 1.33 shown in Fig. 1.34(a) rree branches are given T
{2,4,5,6}
Fi$ l.3a(a)
Element node incidence matrix
[A']
A'=
-1
-t
-l
-l
o@o
0
0
0
0
0
I
-r
0l
0 rl
I 0l
0 -rl
-r 1l
I ol
o o_]
S,
[A]: node @
as
then
o@ @o
0 0l
I -l
0-l
0 rl
0 0l
0-1
I
2
3
10
00
00
A:4
5
0
I
-r0
-r
-1
1l
0l
0]
(oR)
o @@ o
0-1
100
000
001
1-1
0 ,-1
-r0-l
,|
4
5
A-
6
1
210
6[-o
-1
1
1l
o I o]
l;i
A
2
B=6
-1 0
C
11
10
0-l
=[*]
0 0 0l
+l-r
K: s I -t
@oo
I 0 0l
00
-1
-l
ol
0l
0l
rl
0
I
-1
Fig. l.3a@)
t7
I
56 Hffiimltuu:q
Augmented cut-set matrix [B']
4
5
B'=
ABCD
1000
0100
0010
0001
0
J
7
l0-1
0-1-t
-l
EFG
000
000
000
000
100
010
001
=fX:
i-,ltl
4
5
C-
I
3
EFG
-l-10
l_._\D
tin
-r0t
011
001
-i--- o --o
010
001
a
a
I
I
II
tlG
I
I
I
t;I
Fig. I.3a(c)
ABCDEFG
2
4
5
C':6
I
J
7
0 o 0 | _r _1
0 1 0
0' 0 I
0 0 0
0l-1
0000
0 0 0
011
ll0
0 0 0 0l
=;*'
010
0i0
It
or: I 0
l-r
-roor[o
o ol, [:L:
r,-lr
-r _;
;J
-1
0
0
0
-r
-1
0l
0l
0 rl
r0l
3:1
NetuorkMatrices 57
-r -r
t-r
-r o otlo
I
lll
0 -1
o
ollo
m &=A/Kr =
-l
o o
lo
L-l o -1 oilo o 1
fr
=lt
Lo
[-r
c,-BI -l-'
tt:
L:
-
lool
o -r
,l
ol
-l -l -ul=
-r
ol
0l
[n,1
0l
rl
, ,l= t'
0rl
A, Aa-'
-1
00
00
01
-l
A/x e;r = | 0 -t0
[-r 0-l
Io
or:
Ir
lo
Lo
Ir
J]
A:
oro.rl
-1 o o
0 0 o
ooro.]
rl
,l
-l-o l o rl
,ll_;
o
-,
;
;
;l
[-r
oll o o o 1l:l-' o I
oll o o r o-l Lo I I
ol
ol=-''
rl
1.16. For the power system shown in Fig. 1.35. Determine bus incidence matrix 'A',
incidence matrix 'K', basic cut-set maffix 'B' and basic loop incidence matrix 'C' and
drrlw that (i) lu Xr = U (ii) Bt : At t{. fate 1, 5, 4 as tee
lpth
Fig. r.35
(Aug.2fiI7)
58
ElecticalPower S4stemAnalysris
o0-1 @ o
I
I
I
I
I
-1 0
01-1
00-1
-1 00
A:5
2
3
zlt,
=[it]
,/;
l2
| .,'
@
Fig. r.36(a)
o @o
r[ r -, ,l
r:+l-l
,L
ol
r o ,l
ABC
100
010
001
---:l
-i--- o
-l
B-
4
5
I
I
2l,,
,,
l,)
ci6
=[:l
Fig. 1.36(b)
-1
DE
rl -1 -1
ol 0-1
Ic, I
C:5 -1 -1 =Lr,]
l0
0l
r'I
zl
,l
I
q Y'l .....""
:l
(i)
A,KT:
I o -r0
i-l
[u
(,,)
0lI
-l
rl
ilIl
ol
,]
[r
o
tt
ol
Lo o
1l
=lo r
@
Fig. I.36(c)
ol:u
Bl=AlKr
Io
[-r
0
o
,r[
,lL-l
-l
0
l,
:]:[-r
-rl :
-,1
''
a^5
(i)
(ii)
'A'for
of
Find also primitive admittance matrix for thip iystem, it is given that all the lines are characterized
by a seriis impednnce of (0.! + j\.i) ohm/fun and shuni admittance of j0.35 x t0'5 mhos/ton.
Fig. 1.37
(November 2004)
a
b
c
A-
d
e
f
o
10
00
l0
0-l
00
1
10
-1
-l
-l
-1
:
Zp:
Zs:
z
ground/ref
Fig. I.38(a)
(0.1 + j0.7) Q/km
(0.1 + j0.7) x 100
(10 + j70)0
)r4.
Mutual admittances
!n: lzr:
1
i
- --- -i0'014
:0'002
10-3 O
andyro,
10-3 O
iO.42x l0-3(I.
50
Electicaltuurer
Analysis
)r:)r:
Similarly
)ia
)+r
+
Ltt
:
:0.00182
-jl.Olzl
0.0013 -j0.0093
!za.:
0.00166 -j0.01167
Diagonal admittances
Yrr
0-00512 -j0.0354
y:z
Y+r:0.00496- j0.03432
-0.0013 + j0.0093.
-0.002 + j0.014
0
0.00348-jo.0z3gr5 -0.00166 + j0.01167
j0.0093
-0.002 + j0.014 -0.00166+ j0.01167 0.00496 - j0.o3432,
[ -o.oorr +
slroRT
1. Whcn
a graph for
netrvork'J
Ans: For representing parallel connected network elements in a graph curved line
segments
required.
2.
Wltat are the directions assigned to the elements of an oriented graph of a power network?
Ans: The direction assigned to an element of the graph of a power network is taken to the known
assumed direction of current and voltage in the corresponding network element.
3.
4.
7. What is a bus'l
Ans: When one of the nodes of a power network is taken as the reference, then the other
called buses.
nodes
8.
represent?
Ans: The sub matrix C, describes the incidence of branches to basic loops.
ll. What are the elements of Y5u, represent?
and the off
Ans: The diagonal elements of Ysu. represent the short-circuit driving point admittances
diagonal elements, the short-circuit transfer admittances'
t2. How is a uetwork element represented in impedance form?
Are: By a voltage source in series with its self impedance'
matrix.
of You. using an incidence matrix is called singular transformation?
determination
15. Why the
,lns: The incidence matrix which is used in the determination of an interconnected network matrix
network matrix is called a transformation matrix antl is singular. Hence, this
tiom a primitive
transformation is called a singular transformation'
16. How Y5u. is determined if some of the network elements are coupled?
Are: Y5,,, is determined by singular transtbrmation using Yhr. : At Dl e
17. How Zt.,,,p is determined if all the network elements are uncoupled?
Am: All tliagonal elements are determined as the sum of the impedances of elements in the basic loop'
negative of
corresponding to that diagonal element. An off-diagonal element is determined as the
to this
pertaining
loops
basic
the
to
common
the sum of the impedances of the network elements
off-diagonal element.
ft. If Znu. is required, how can it be determined using singular transformation?
Ans: Znu" is determined by singular transtbrmation using Zbr, = {Arb]A}-'
62 ElectrbalPouser
Anatgsis
23. The entries in the bus admittance matrix are either +l of -l or 0. Is it a fact?
Ans: Yes
24. what cloes an entry of -l in fh row and /th column of matrix A denote ? .
Ans: It shows that the fh element is incident to the ts node and is directed towards it.
25. Write down the pertbrmance equation of an interconnected network in the bus frame of
Ans: Ior. =Yr,rrVr,r.
26. ln the transformation. used to obtain Ynu*, power variant
Ans: No
27. What is a Tree?
Ans: A tree is a sub graph containing all the nodes of the original graph but no closed paths or loops.
28. Define Twigs?
Ans: These are the braches of the trees.
29. What are the type for Construction of primitive network element ?
Ans: There are two types of representation:
1l) Impedance form (ii) Admittance form.
30. What is the Iimitation for direct inspection method?
Ans: The impedance and admittances can be found by direct inspection method provided mutual
between the elements of the given power system network is neglected.
what are the tbrmulae for determined you, from direct inspection method?
31.
Ans: Self admiffance, Yii = the sum of the admittances of
Mutual admittance, Y,7
32. what are the lormulae
.i'
Z, :
'i'
and
path
(c) botr
(d)
none
6.
A network has seven nodes and five independent loop, then the rrumbcr of
(a\
13
(b)
12
(c)
1l
rlanr:
(4 x)
in
be
tb netrrork is
(a)
t.
ll.
K,) =
(b\ -1
(c)
K, -'
(d)
none
(d)
none
(a) links by nodes (b) elements by links (c) links by branches (d) none
ll. The performance equation in impedance form is
(a) v * i = z\e
(b), t, s - 1xi
(c) both
(d) none
Lll. In the loop frame of reference, the perforrnance of an interconnected network is
described
by________
Zbu* expression
(D * zur.
(c) K zBRlK
of various components in a power system is called
(a) branches
(b) bus
(c) links
(a) K'YBRK
Itl.
(4
K'
ZBRK
The meeting
(d) none
15. If You, is symmetrical then the corresponding Zru" is
(a) unsymrnetrical (b) symmetrical
(c) neither (a) nor (b) (d) none
15. The off-diagonal elements in You" are called as
(c) self admittance (b) mutual admittance (c) symmetrical
(d) att
17. A set of unconnected elements is defined as a
network.
(a) primitive
(D) complete
(c) symmetrical
(d) att
It.
(d)
none
ANSWERS
r.
(b)
7. (a\
13.
(d)
2. (a)
8. (D)
14.
(b\
4.
3.. (a)
9. (a\
rs.
(b)
10. (r)
16. (b)
(b)
5.
(a)
6.
(c)
11. (r)
17. (a)
12.
(c)
EXERCISE
1. Define the following matrices with one example for each matrix.
(a) Elements node incidence matrix
(b) Bus incidence matrix
(c) Basic cut:St incidence matrix
(d) Basic loop incidence matrix
(e) Branch path incidence matrix.
8.(A
il
Etecfficalfuwer fustemAnalgsls
3.
ooo
0
r[-l
0l
^ zl rr -lo -llol
o:rl
+L o
-r
4.
@) A,,kr
5.
6.
7.
'j
: U
(D)
C'[B']r : U
(c)
Co
- - B,t
Determine the Zsu. and Yuu. for the following network shown in
in p.u. value.
15
j7.5
Fig. 1.39
Determine Ysu. flnd Zrn., by direct inspection method for the following network shown in Fig.
is
i20
j2s
i15
i10
Fig. l.4O
Given values
urlin
p.u. of impedances.
j5
Power SgstemNehuorkMatnces
6t
in Fig. 1.41.
Fig. r.4l
r0. For the problem 9 the impedance values are given below. Determine Y6u, and Zsu, by singular
transformation method.
Element No.
1
1.5
6
7
2.5
1.0
2.0
1.25