Example:
Single-line diagram:
2 4
1
G
G
1 2 3 4
6
5 4
2
3
1
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 1
Tree – a connected subgraph containing all nodes of a graph but no closed path.
Branches – the elements of a tree
Number of branches b required to form a tree:
Links – elements of the connected graph that are not included in the tree.
Cotree – a subgraph formed by the links of a connected graph.
Number of links l of a connected graph:
It follows that
l = e − n +1
Example:
1 2 3 4
6
5 4
2
3
1
Branch
0
Link
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 2
INCIDENCE MATRICES
The elements of the element-node incidence matrix of a connected graph are as follows:
aij = 1 if the ith element is incident to and oriented away from the jth
node.
aij = −1 if the ith element is incident to and oriented towards from the jth
node.
aij = 0 if the ith element is not incident to the jth node.
Example:
1 1 − 1
2 1 −1
3 1 − 1
 = 4 −1 1
5 1 −1
6 1 −1
7 1 − 1
Elements
Since
n−1
∑ aij = 0 i = 1,2, K , e
j =0
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 3
Bus Incidence Matrix A
Example:
For the previous example network, if node 0 is chosen as the reference node, the bus
incidence matrix is,
Element
Binary valued matrix – a matrix whose entries are binary (Boolean) variables.
B s symmetric
Negation: A : All TRUE elements of A are replaced by FALSE, and all FALSE
entries by TRUE
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 4
Boolean AND: A•B
Boolean OR: A + B
The operation B•B produces a square matrix of dimension n for an n-bus system
where (B•B)ij is 1 when buses i and j are joined by a line or are joined through an
intervening bus by a line. Otherwise (B•B)ij is 0.
Example:
(1)
(3) (5)
(2)
(4)
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 5
(1) (2) (3) (4) (5)
(1) 1 1 1 1 0
( 2) 1 1 1 1 1
B • B = (3) 1 1 1 1 1
( 4) 1 1 1 1 0
(5) 0 1 1 0 1
Note that B•B•B is also square and contains “1” in positions corresponding to buses
joined by three or fewer lines and two or less intervening buses. The diagonal entries
of B, B•B, B•B•B, and so on, are all “1”.
If B is the binary bus connection matrix for an n-bus power system, and the notation
(m)
B ,
B ( m) = B • B • L • B
← m times →
(1) (m)
is used to denote repeated AND operations, and B = B, then B consists of all 0’s
(m)
except in the diagonal position, where 1’s appear. Also, the position ij of B contains
1’s if and only if buses i and j are joined via m lines or less (hence giving m − 1
(n−1)
intervening buses). Furthermore, for an n-bus system B consists of all 1’s when all
system buses are connected to the system.
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 6
Bus Disconnection Matrix B
The disconnection matrix B and the matrices B • B , B • B • B , and so on, have
(2) (3)
properties similar to B , B , and so on. Allowing D to denote the bus disconnection
matrix, it is easy to show that
[ ]
B ( k ) D ( l ) = B ( k −l )
For a system of l lines and n buses, L is l × n. This matrix is used to calculate the voltage
difference between the buses at the terminals of each system line. Let Vline be a l-vector
of “line voltages” (i.e., voltage drops across each system line); then
Vline = L Vbus
For the purpose of calculating line voltage drops, each line must be considered to be
directed (i.e., having a start or higher voltage bus and an end or lower voltage bus). This
convention is reflected in the definition of line start and end in matrix L. While it is
unimportant which bus is selected as the start of a line and which as the end, once the
convention is established, it must be consistent in the definition of elements of Vbus.
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 7
BUS ADMITTANCE MATRIX Ybus
Node Equations
Node − a junction formed when two or more circuit elements (R, L, C, Vs, Is) are
connected to each other at their terminals.
Yb 2 Ye
Yc Yd Yf
3 4
1
I3 Ya Yg I4
0
Reference
( )
V1 Yc + Yd + Y f − V2Yd − V3Yc − V4Y f = 0
− V1Yc − V2Yb + V3 (Ya + Yb + Yc ) = I 3
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 8
General matrix format:
or Ybus V = I
Yc( + Yd + Y f ) − Yd − Yc −Yf
− Yd (Yb + Yd + Ye ) − Yb − Ye
Ybus =
− Yc − Yb (Ya + Yb + Yc ) 0
−Yf − Ye 0 (
Ye + Y f + Yg )
Separating the entries for Yc,
(
Yd + Y f ) − Yd 0 −Yf
−Y (Yb + Yd + Ye ) − Yb − Ye
Ybus =
d
0 − Yb (Ya + Yb ) 0
− Y f − Ye 0 (Ye + Y f + Yg )
Yc 0 − Yc 0
0 0 0 0
+
− Yc 0 Yc 0
0 0 0 0
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 9
More compactly,
Yc ⋅ − Yc ⋅ (1) (3)
⋅
⋅ ⋅ ⋅ 1 − 1
− Yc ⋅
⇔ Yc
⋅ Yc − 1 1
⋅ ⋅ ⋅ ⋅
The smaller matrix on the right is a compact storage matrix for matrix contribution of Yc
to Ybus. It is an important building block in forming Ybus for more general networks.
I I
N N
Za + e + e
t t
w w
+ V o
Is Ya V o
Es r r
k k
- - -
E s = IZ a + V
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 10
The voltage source Es and its series impedance Za can be interchanged with the current
source Is and its shunt admittance Ya, provided that
Es 1
Is = and Ya =
Za Za
Sources Es and Is may be considered externally applied at the nodes of the transmission
network, which then consists of only passive branches.
Suppose that only branch admittance Ya is connected between nodes m and n as part of a
larger network of which only the reference node is shown,
Za = branch impedance, primitive impedance
Im m Ia + Va - n In
+ +
Ya = 1/Za
Vm Vn
- -
Reference node
I m 1 Vm
I = − 1 I a ; Va = [1 − 1] V
n n
Vm
YaVa = I a ; Ya [1 − 1] = I a
Vn
1 Vm 1 I m
− 1Ya [1 − 1] V = − 1 I a = I
n n
Ya − Ya Vm I m
− Y =
a Ya Vn I n nodal admittance equation for branch Ya
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 11
The nodal admittance matrix is singular because neither node m nor node n connects
to the reference.
[Ya ]Vm = I m
This corresponds to removal of row n and column n from the coefficient matrix (nodal
admittance matrix).
Note that
1 1 − 1
− 1[1 − 1] = − 1 1
building block
The nodal admittance matrices are simply storage matrices with row and column
labels determined by the end nodes of the branch. To obtain the overall nodal
admittance matrix of a network, we simply combine the individual branch matrices
by adding together elements with identical row and column labels.
Such addition causes the sum of the branch currents flowing from each node of the
network to equal the total current injected into that node, as required by KCL.
Provided at least one of the network branches is connected to the reference node, the
net result is Ybus of the system.
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 12
Example:
Single-line diagram:
3 4
1
2
j0.25 j0.2
j0.125
j0.25 j0.4
3 4
1
j0.1 j0.1
j1.15 j1.15
+ +
1.25 0o 0 0.85 -45 o
- -
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 13
Admittance diagram:
Ib 2 Ie
-j4.0 -j5.0
Ic Id -j8.0 If
3 -j4.0 -j2.5 4
Ia 1 Ig
-j0.8 0
-j0.8
1 -90
0.68 -135
Combining elements of the above matrices having identical row and column labels,
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 14
Mutually Coupled Branches in Ybus
Ia Ib
Im ZM
+ + Ip
Va Za Zb Vb
In - - Iq
Ia Ib
Im YM
+ + Ip
Va Ya Yb Vb
In - - Iq
Va Z a Z M Ia
V = Z Z b I b
b M
where mutual impedance ZM is positive when Ia and Ib enter the dotted terminals.
−1
Za ZM 1 Zb − Z M Ya YM
Z = =
M Z b
Z a Z b − Z M 2 − Z M Z a YM Yb
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 15
Voltage-drop equations:
Vm Vm
V
Va Vm − Vn 1 − 1 0 0 Vn n
V = V − V = 0 0 1 − 1 V = A V
b p q p p
Vq Vq
Current equations:
I m 1 0
I
n = − 1 0 I a = AT I a
I p 0 1 I b I
b
I
q 0 − 1
Premultiply by AT,
Vm I m
V
Ya YM n T I a I n
AT A =A =
YM Yb V p Ib I p
Vq I q
The 4 × 4 submatrices above form part of the larger nodal admittance matrix of the
overall system. The pointers m, n, p, q indicate the rows and columns of the system
matrix to which the elements of the above nodal admittance matrix belong.
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 16
Nodal admittance matrix by inspection:
If node n is the reference, we may eliminate the row and column of that node.
If n and q are one and the same node, columns n and q are combined (since Vn = Vq),
and the corresponding rows are added because In and Iq are parts of the common
injected current.
Example:
j0.25 2
3 j0.25
j0.15
1
j0.25
Primitive admittances:
−1
j 0.25 j 0.15 − j 6.25 j 3.75
j 0.15 =
j 0.25
j 3.75 − j 6.25
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 17
Adding the columns and rows of the common node 3,
Nodal equations:
m p r
Ia Ib Ic
Za Zb Zc
ZM1 ZM2
n q s
−1
Za ZM1 ZM 2 Ya YM 1 YM 2
Z Zb 0 = YM 1 Yb YM 3
M1
Z M 2 0 Z c YM 2 YM 3 Yc
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 18
3. Label the two rows and the two columns of each diagonal building-block matrix with
the end-node numbers of the corresponding self-admittance. For mutually coupled
branches it is important to label in the order of the marked (dotted) --- then ---
unmarked (undotted) node numbers.
4. Label the two rows of each off-diagonal building-block matrix with node numbers
aligned and consistent with the row labels assigned in (3); then label the columns
consistent with the column labels of (3).
5. Combine, by adding together, those elements with identical row and column labels to
obtain the nodal admittance matrix of the overall network. If one of the nodes
encountered is the reference node, omit its row and column to obtain the system
Ybus.
Bus Admittance Matrix 1 -- A.C. Nerves, U.P. Dept. of Electrical & Electronics Engineering, Nov. 13 2003 19