0% found this document useful (0 votes)
262 views16 pages

Example of (Z:) Matrix Building Algorithm

The document describes the step-by-step process of building a ZBus matrix to model a power system network. It provides an example network and outlines 6 steps: 1) Add the first line, 2) Add the second line, 3) Add the first link, 4) Add a new node and line, 5) Add another new node and line, 6) Add the final link. For each step, it shows the partial network diagram and updates the corresponding ZBus matrix based on the element added.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
262 views16 pages

Example of (Z:) Matrix Building Algorithm

The document describes the step-by-step process of building a ZBus matrix to model a power system network. It provides an example network and outlines 6 steps: 1) Add the first line, 2) Add the second line, 3) Add the first link, 4) Add a new node and line, 5) Add another new node and line, 6) Add the final link. For each step, it shows the partial network diagram and updates the corresponding ZBus matrix based on the element added.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 16

4.

2 Example of [ZBus ] matrix building algorithm


The single line diagram of a power system is shown in the Fig. 4.16. The line impedances in pu are
also given. The step-by-step procedure for [Z¯ Bus ] matrix formulation is explained as given below:

Figure 4.16: Single Line Diagram of the Power System for the example

Preliminary Step: The graph of the network and a tree is shown in Fig. 4.17. Elements 1,2,4
and 5 are the tree branches while 3, 6 and 7 are the links.

Figure 4.17: Graph and a tree of the network of Fig. 4.17

Step 1: The step-by-step [Z¯ Bus ] matrix building algorithm starts with element 1, which
is a tree branch connected between nodes 1 and the reference node 0 and has an impedance
of z¯10 = j0.10 pu. This is shown in the accompanying figure ,Fig. 4.18.

118
Figure 4.18: Partial network of Step 1

The resulting [Z¯ Bus ] matrix is

(1) (1)

Z¯ Bus = (1) z10 = (1) j0.10

Step 2: Next, the element 2 connected between node 2 (q = 2) and the reference node ‘0’ is
selected. This element has an impedance of z¯20 = j0.10 p.u. As this is the addition of a tree
branch
it will add a new node ‘2’ to the existing [Z¯ Bus ] matrix. This addition is illustrated in Fig. 4.19.

Figure 4.19: Partial network of Step 2

The new bus impedance matrix is given by :


(1) (2) (1) (2)

( 1) j0.10 0 (1) j0.1 0


Z¯ Bus = =
(2) 0 z20 (2) 0 j0.10

Step 3: Element 3 connected between existing nodes, node 1 (p = 1) and node 2 (q = 2),
having an impedance of z¯12 = j0.20 p.u. is added to the partial network, as shown in Fig. 4.20.
Since this is an addition of a link to the network a two step procedure is to be followed. In the
Figure 4.20: Partial network of Step 3

first step a new row and column is added to the matrix as given below :
(1) (2) (`) (1) (2) (`)
<@ ¯ ¯11 ) = (1) < j0.10 =
(1) j0.10 0.0 (Z12 A @ 0.0 −j0.10 A
@ AA @ 0.0 j0.10 j0.10 A
¯ (temp)
Z = (2) @ 0.0 j0.10 ¯ − ¯21 )
(Z22 A = (2) @
Bus
@@ A
@
− ¯ ) (Z ¯ − ¯ ) Z¯Z AA @
@
A
A
(`) > 21
(Z¯ Z
11 22 12 `` ? (`) > −j0.10 j0.10 j0.40 ?
Z
where,
Z¯`` = ¯11 + ¯22 − 2Z12
¯+ = j0.10 + j0.10 − 0.0 + j0.20 = j0.40 p.u.
Z Z z¯20

Next this new row and column is eliminated to restore the size of [Z¯ Bus ] matrix as given below:

−j0.10
−j 0.10 j 0.10
j0.10 0.0 j 0.10
[Z¯ Bus ] = −
0.0 j0.10 j0.40

Hence, the impedance matrix after the addition of element 3 is found out to be :

(1) (2)

1)( j0.075 j0.025


[Z¯ Bus ] =
(2) j0.025 j0.075

Step 4: The element 4 , which is added next, is connected between an existing node, node 2
(p = 2) and a new node, node 3 (q = 3). The impedance of this element is z¯23 = j0.30 p.u.
and it is a tree branch hence, a new node, node 3 is added to the partial network. This addition,
shown
in Fig. 4.21, thus increases the size of [Z¯ Bus ] to (3 × 3).
Figure 4.21: Partial network of Step 4

The new impedance matrix can be calculated as:


(1) (2) (3) (1) (2) (3)
< Z¯12 = (1) < j0.075 j0.025 j0.025 =
@@ j0.075 j0.025
(1) AA A
@
Z¯ Bus = @@ j0.025 j0.0.075 Z¯22 A = (2)
A
@ j0.025 j0.0.075 j0.075 A
@ A
(2)
@ A @ A
(3) @> Z¯21 Z¯22 Z¯22 + 23 A? (3) @
> j0.025 j0.075 j0.375 ?
A

Step 5: Element 5 is added next to the existing partial network. This is a tree branch connected
between an existing node, node 3 (p = 3) and a new node, node 4 (q = 4). This is illustrated
in Fig. 4.22.

Since a new node is added to the partial network, the size of [Z¯ Bus ] increases to (4 × 4).
The impedance of the new element is z¯34 = j0.15 p.u. The new bus impedance matrix is :

(1) (2) (3) (4) (1) (2) (3) (4)


< =
(1) @@ j0.075 j0.025 j0.025 Z¯31 =A (1) @< j0.075 j0.025 j0.025 j0.025 A
@ Z¯32 AAA (2) @@
j0.075 j0.075 A
¯ Bus =
(2) @ j0.025 j0.075 j0.075 A= @@ j0.025 j0.075 AA
Z @ ¯ @@
(3) @@ j0.025 j0.075 j0.375 A (3) A
Z
33
A @ j0.025 j0.075 j0.375 j0.375
A
¯ ¯ ¯
13
@ @
(4) Z23 Z33 Z33 z¯34 (4)
@> j0.025 j0.075 j0.375 j0.525 A?
Z ¯ + A
> ?

Step 6: Next,the element 6 connected between two existing nodes node 1 (p = 1) and node
4 (q = 4) is added to the network, as shown in the Fig. 4.23. The impedance of this element
is z¯23 = j0.25 p.u. As this is a link addition, the two step procedure is used. The bus
impedance
Figure 4.22: Partial network of Step 5

Figure 4.23: Partial network of Step 6

matrix is modified by adding a new row and column as given below:

(1) (2) (3) (4) (`)

(1) < @ j0.075 j0.025 j0.025 j0.025 (Z¯14 − Z¯11 ) =A


@@ j0.025 j0.075 j0.075 j0.075 (Z¯ Z¯ ) AA
(2) @ 24 21 A
@@ j 0. −¯34 −
¯ (temp)
Z (3) Z A Z)¯ A
= j 0. ¯44
Bus @ >
(4) @@@ ( − − ¯4112 ¯11 43
¯ ) (Z¯
(`) @ Z Z 42
Z ) (Z¯
3
1
¯ ) (Z¯ ¯) Z −A − − ¯ ¯ A
14 13 44 A
Z Z
Z41 )
A
`À Z
?
Substituting the values of appropriate [Z¯ Bus ] matrix elements in the last row and column
the intermediate impedance matrix is:
(1) (2) (3) (4) (`)

(1) @< j0.075 j0.025 j0.025 j0.025 −j0.05 =A


@@ A
(2) @@ j0.025 j0.075 j0.075 j0.075 j0.05 AA
¯ (temp) @ A
Z Bus = (3) @ j0.25 j0.075 j0.375 j0.375 j0.35 AA
(4) @@ j0.025 j0.075 j0.375 j0.525 j0 .50 A
@ A
A
(`) @> − j0.05 0.05 j0.35 j0.50 j0.80 ?A

where,

Z¯`` = ¯44 + ¯11 − 2Z14


¯+ = j0.075 + j0.525 − 2 × j0.025 + j0.25 = j0.80 p.u.
Z Z z¯14

The additional row and column ‘`’ are to be eliminated to restore the impedance matrix size to
(m × m), and the [Z¯ Bus ] matrix after the addition of element 6 is calculated as:

<
@−j0.05A=
@ A
@@ j0.50 AA
@ A −j0.05 j0.05 j0.35 j0.50
<@j0.075
@ j0.025 j0.025 j0.025AA= @@
@@
j0.35 AA
A
Bus @
j0.075AA > j0.50 A
@ ¯ ] [email protected]
[Z
j0.075 j0.075
A− ?
@@ j0.25 j0.075 j0.375 j0.375AA j0.80
@@ AA
>j0.025 j0.075 j0.375 j0.525 ?

Hence,
(1) (2) (3) (4)

(1) @@< j0.0719 j0.0281 j0.0469 j0.0563 =A


@ j0.0281 j0.0719 j0.0531 j0.0437 A
¯ Bus =
(2) @ AA
Z @
(3) @@ j0.0469 j0.0531 j0.2219 j0.1562 A
@ AA
(4) @
> j0.0563 j0.0437 j0.1562 j0.2125 A?
Step 7: Finally the element 7 connected between two existing nodes node 2 (p = 2) and node 4
(q = 4) is added to the partial network of step 6. The impedance of this element is is z¯23 =
j0.40 pu. This is also a link addition, as shown in Fig. 4.24 and hence the two step precedure
will be to obtain the
followed Bus matrix. In the first step the is calculated after a row and a
[Z¯ Z¯
( temp)
] Bus
Figure 4.24: Partial network of Step 7

column are added to the exiting Z¯ Bus as follows:

(1) < @ Z¯12 ) =


A
(1) (2) (3) (4) (`)

(2) @@@ j0.0719 j0.0281 j0.0469 j0.0563 (Z¯1424 − Z¯22) AA


A
¯ (temp)
Z (3) @@ j
j0.0281 j0.0719 j0.0531 j0.0437 (ZZ¯ A Z)¯ A
=
Bus @ 0.0469 j0.0531 j0.2219 j0.1562 −
@ 32 A

Z 44 − Z42 ) AAA
(4)
@@ j 0. ¯ ¯
@> ( ¯41 − ¯21 ) (Z¯42 ¯− )22 (Z¯ 43 − ¯23 ) (Z¯44 − ¯24 ) Z¯`` A
(`) ?
Z Z Z Z Z
Substituing the values of the elements of impedance matrix one gets:
(1) (2) (3) (4) (`)

(1) @< j0.0719 j0.0281 j0.0469 j0.0563 j0.281 =


@ A
− A
(2) @@ j0.02810 j0.0719 j0.0531 j0.0437 j0.281 AA
¯ (temp) @ A
Z
Bus =
(3) @ j0.0469 j0.0531 j0.2219 j0.1562 j1031 AA
@@
(4) @@ j0.0563 j0.0437 j0.1562 j0.2125 j0.1688 AAA
(`) @ j0.281
> −j0.281 j0.1031 j0.1688 j0.5969 A?
where,

Z¯`` = ¯22 + ¯44 − 2Z24


¯+ = j0.0719 + j0.2125 − 2 × j0.0563 + j0.40 = j0.5969 p.u.
Z Z z¯24
The additional row and column ‘`’ are to be eliminated to restore the impedance matrix size to
(m × m), and [Z¯ Bus ] after the addition of element 7 is calculated as:

<
@ j0.0281 A=
@@ AAA
<
@j0.0719 j0.0281 j0.0469 @@ j0.1031 AAA j 0281 −
j0.0563AA= @
0.1688
@ @ A
Bus @
@ ¯ ] [email protected] j0.0719 j0.0531 j0.0437AA @> j0.1688 ? A
[Z A−
@@ j0.469 j0.0531 j0.2219 j0.1562AA j0.5969
@@ AA
>j0.0563 j0.0437 j0.1562 j0.2125 ?

Hence,
(1) (2) (3) (4)

(1) @@< j0.0705 j0.0295 j0.0420 j0.0483 =A


@ j0.0295 j0.0705 j0.0580 j0.0517 A
¯ Bus =
(2) @ AA
Z @
(3) @@ j0.0420 j0.0580 j0.2041 j0.1271 A
@ AA
(4) @
> A
j0.0483 j0.0517 j0.1271 j0.1648 ?

As can be seen that the final [Z¯ Bus ] matrix is a (4 × 4) matrix, as the network has 4 nodes
and a reference node. As there are 7 elements is the network, 7 steps are required for the
formation of [Z¯ Bus ] matrix.

4.2.1 Modifications in the existing [Z¯ Bus ]


:

If in an existing network, for which the [Z¯ Bus ] matrix is known, some modification such as
line removal or line impedance alteration is carried out then the [Z¯ Bus ] matrix can be easily
modified without any need of reconstructing the matrix from scratch.
As an example, let the Z¯ Bus matrix be the final bus impedance matrix given for the network
of Fig. 4.16. Next, let the element 7 connecting nodes 2 and 4 be removed from the network and
it is required to find the modified Z¯ Bus .
Removal of element 7 is equivalent to setting its impedance z¯24 to infinite. This can be
org
obtained by connecting a fictitious element z¯add in parallel to the existing element z¯ such that
the resultant 24 24
impedance z¯24result is infinite
i.e.
1 1 1 1
result
= org + add
= 0
z¯ z¯ = z¯ ∞
24 24 24

or
org
z¯add24 = −z¯ 24 = −j0.40
p.u.
org
Hence, by adding an element z¯add = −j0.4 p.u. in parallel to z¯ the removal of line between
nodes
24 24
2 and 4 can be simulated. The new added fictitious element is a link addition between the two nodes,
p = 2 and q = 4 and is shown in Fig. 4.25 . Hence, this will require a two-step procedure. The
addition of the fictitious element 8 , which is a link, will introduce a temporary row and column.
Figure 4.25: Adding a link to simulate the removal of element 7

The Bus is given as:



(temp)

(1) (2) (3) (4) (`)

(1) @< j0.0705 j0.0295 j0.0420 j0.0483 (Z¯14 − Z¯12 ) =A

(2) @@@ j0.0295 j0.0705 j0.0580 j0.0517¯ − ¯22 ) AA


AA
¯ (temp) @ (Z 24 Z ¯
Z
Bus = 0. Z¯
34 32 ) A
(3) @@ j A
@ j 0. − Z¯44 − Z¯42 ) A
(4) @
@@ ¯ ¯ ¯ ¯ − ¯ ¯ Z ¯24 ) A
(`) > ( 41 − ¯21 ) (Z42 − 22 ) (Z43 Z 23 ) (Z44 Z¯`` ?
Z Z Z
Substituting the appropriate values one gets:
(1) (2) (3) (4) (`)

(1) @< j0.0705 j0.0295 j0.0420 j0.0483 j0.0188 =


@ A
− A
(2) @@ j0.0295 j0.0705 j0.0580 j0.0517 j0.0188 AA
¯ (temp) @ A
Z
Bus =
(3) @ j0.0420 j0.0580 j0.2041 j0.1271 j0.0691 AA
@ A
(4) @@ j0.0483 j0.0517 j0.1271 j0.1648 j0.1131 AA
@ @>
whe ? (`)
re,

24 24
j0.018 −j0. 0188 j0.0691 j0.1131 −j0.2681 A
8

Z¯`` = ¯22 + ¯44 − 2Z¯ + z¯add = j0.0705 + j0.1648 − 2 × j0.0483 + (−j0.40) = −j0.2681
Z Z p.u.
The additional row and column is eliminated in the following step:

<
@ j0.0188 A=
@@ AAA
<
@j0.0705 j0.0295 j0.0420 @@ j0.0691 AAA j 0188 −
j0.0483AA= @
0.1131
@ @ A
Bus @
@[Z¯ ] [email protected] j0.0705 j0.0580 j0.0517AA @> j0.1131 ? A
A−
@j0.0420
@ j0.0580 j0.2041 j0.1271AA −j0.2681
@@ AA
>j0.0483 j0.0517 j0.1271 j0.1648 ?

Thus, the final impedance matrix after the removal of element 7 is :

(1) (2) (3) (4)

(1) @@< j0.0719 j0.0281 j0.0469 j0.0563 =A


@ j0.0281 j0.0719 j0.0531 j0.0437 A
¯ Bus =
(2) @ AA
Z @
(3) @@ j0.0469 j0.0531 j0.2219 j0.1562 A
(4) @@ A
A
> j0.0563 j0.0437 j0.1562 j0.2125 A?

The obtained Z¯ Bus matrix is identical to the Z¯ Bus matrix obtained in step 6 of the
previous example, which is the impdance matrix of the network before the addition of element 7.
So far we have considered the Z¯ Bus matrix building algorithm without any presence of mutually
coupled elements. In the next lecture, we will take into account the presence of mutually coupled
elements while forming the Z¯ Bus matrix.

You might also like