ECEG 6071

Power System Analysis

Chapter 2— The Admittance Model and

Network Calculations
Dr. Ayele Nigussie
Assistant Professor of Electrical Engineering
Department of Electrical & Computer Engineering
Haramaya Institute of Technology
Haramaya University

AN Legesse, PhD 1
Outline

o Branch and Node Admittances

o Mutually Coupled Branches in 𝑌𝐵𝑈𝑆
o An Equivalent Admittance Network
o Modification of 𝑌𝐵𝑈𝑆
o Network Incidence Matrix and Application of Graph Theory
to for 𝑌𝐵𝑈𝑆
o Method of Successive Elimination
o Node Elimination
o Triangular Factorization,
o Scarcity and Near Optimal Ordering (Reading Assignment)

AN Legesse, PhD 2
 Class Objectives
After completing this chapter, you will
o understand branch and node admittances
o distinguish and analyze mutually coupled branches in 𝑌𝐵𝑈𝑆
o find an equivalent admittance network
o modify 𝑌𝐵𝑈𝑆
o analyze network incidence matrix and 𝑌𝐵𝑈𝑆
o apply method of successive elimination
o apply node elimination
o use triangular factorization,
o understand scarcity and near optimal ordering
o describe the application of Graph Theory

AN Legesse, PhD 3
2.0 Introduction
• A power system model is represented by a network matrix.
• Current flow can be related to voltage by either an admittance
or an impedance parameter.
• A primitive model describes the electrical characteristics of the
network components.
• The primitive model neither requires nor provides any
information about how the components are interconnected to
form the network.
• The nodal admittance matrix gives the steady-state behaviour of
all the components acting together as a system.
• The admittance matrix is obtained from nodal analysis of the
network equations.

AN Legesse, PhD 4
2.1Branch and Node Admittances

• Consider a generator model:

AN Legesse, PhD 5
2.1Branch and Node Admittances …

• Applying KVL, the voltage equation for the source is:

𝐸𝑠 = 𝐼𝑍𝑎 + 𝑉
• Rearranging the above equation gives the current equation
as:
𝐸𝑠
𝐼𝑠 = = I + 𝑌𝑎 𝑉
𝑍𝑎

• Where
𝐸𝑠 1
𝐼𝑠 = and 𝑌𝑎 =
𝑍𝑎 𝑍𝑎

AN Legesse, PhD 6
2.1Branch and Node Admittances …

• 𝐸𝑠 and 𝐼𝑠 are external sources at the nodes.

• For network modeling, a typical branch can be represented by
either the branch impedance 𝑍𝑎 or the branch admittance 𝑌𝑎 .
• Subscripts a and b distinguish branch quantities.
• 𝑍𝑎 is primitive impedance and 𝑌𝑎 is primitive admittance and
𝑉𝑎 = 𝑍𝑎 𝐼𝑎 or 𝐼𝑎 = 𝑌𝑎 𝑉𝑎
1
𝑌𝑎 =
𝑍𝑎
• 𝑉𝑎 is the voltage drop across the branch in the direction of the
branch current 𝐼𝑎 .

AN Legesse, PhD 7
2.1Branch and Node Admittances …

• A branch has two associated variables 𝑉𝑎 and 𝐼𝑎 .

• A branch can be represented in two forms:
1. Admittance form and
2. Impedance form.
• In this chapter, we will discuss the admittance form only.
• The impedance form will be discussed in Chapter 3.
• In Chapter 1, we saw an easy method to form 𝑌𝑏𝑢𝑠 .
• What are the limitations of the method presented in Chapter 1?
• This chapter presents a more general method of forming a 𝑌𝑏𝑢𝑠 .

AN Legesse, PhD 8
2.1Branch and Node Admittances …

• Consider the following branch:

AN Legesse, PhD 9
2.1Branch and Node Admittances …

• In the figure, 𝑌𝑎 is connected between nodes m and n as part

of a larger network.
• Current injected into a node is positive while the one leaving
the node is negative.
• 𝐼𝑚 is current injected into node m and 𝐼𝑛 is that portion of
the current injected into node n which passes through 𝑌𝑎 .
• 𝑉𝑚 and 𝑉𝑛 are node voltages.
• Applying KCL at nodes m and n
𝐼𝑚 = 𝐼𝑎
𝐼𝑛 = −𝐼𝑎
𝑰𝒎 𝒎 𝟏
• In matrix form, = 𝑰
𝑰𝒏 𝒏 −𝟏 𝒂
AN Legesse, PhD 10
2.1Branch and Node Admittances …

• In a similar manner, the voltage drop in the direction of 𝐼𝑎 has

the equation
𝑉𝑎 = 𝑉𝑚 − 𝑉𝑛
𝑽𝒎
• In matrix form, 𝑽𝒂 = 𝟏 −𝟏
𝑽𝒏
• Substituting this expression for 𝑉𝑎 in the admittance equation
𝑌𝑎 𝑉𝑎 = 𝐼𝑎 gives
𝑉𝑚
𝒀𝑎 1 −1 = 𝑰𝒂
𝑉𝑛
𝐼𝑚 𝑚 1
• Multiplying both sides by = 𝐼 gives
𝐼𝑛 𝑛 −1 𝑎
AN Legesse, PhD 11
2.1Branch and Node Admittances …

• Which simplifies to

• This is the nodal admittance equation for branch 𝑌𝑎 and the

coefficient matrix is the nodal admittance matrix .

AN Legesse, PhD 12
2.1Branch and Node Admittances …

• Off-diagonal elements are equal to the negative of the branch

admittance.
• The admittance matrix is singular because both nodes are not
connected to the reference node.
• If one of the nodes is a reference, i.e 𝑉𝑛 = 0, the admittance
equation reduces to

• An important matrix for building more general networks is

AN Legesse, PhD 13
2.1Branch and Node Admittances …

• The row and column pointers identify each entry in the

coefficient matrix by node numbers. For instance, in the first
row and second column of the above equation, the entry - 1 is
identified with nodes m and n.
• The overall nodal admittance matrix of the entire network is
obtained by combining the individual branch matrices by adding
together elements with identical row and column labels.
• In the overall matrix, 𝑌𝑖𝑗 is the negative sum of the admittances
connected between nodes i and j.
• 𝑌𝑖𝑖 is the algebraic sum of the admittances connected to node i.
• Provided that at least one of the network branches is connected
to the reference node, the net result is 𝑌𝐵𝑈𝑆 of the system.

AN Legesse, PhD 14
2.1Branch and Node Admittances …
Example

• The one-line diagram of a small power system is shown on the

next slide. The corresponding reactance diagram, with
reactances specified in per unit, is also shown. A generator
with emf equal to 1.25∠0𝑜 per unit is connected through a
transformer to high-voltage node 3 while a motor with
internal voltage equal to 0.85∠ −45𝑜 is similarly connected to
node 4· Develop the nodal admittance matrix for each of the
network branches and then write th nodal admittance
equations of the system.

AN Legesse, PhD 15
2.1Branch and Node Admittances …
Example

AN Legesse, PhD 16
2.1Branch and Node Admittances …
Example
• Solution: the admittance network model looks like:

AN Legesse, PhD 17
2.1Branch and Node Admittances …
Example
• The branch admittance matrices are:

AN Legesse, PhD 18
2.1Branch and Node Admittances …
Example
• Now add elements with the same subscripts:

• The overall network nodal admittance equations are shown in

the next slide.

AN Legesse, PhD 19
2.1Branch and Node Admittances …
Example

• The 𝑌𝑏𝑢𝑠 here is the same as the one obtained with the
technique in Chapter 1.
• Thus, the 𝑌𝑏𝑢𝑠 is formed based on the building blocks.

AN Legesse, PhD 20
 2.2 Mutually Coupled Branches
in 𝑌𝐵𝑈𝑆 …
• Considering the
figure, the voltage
drops are:
𝑉𝑎 𝑍𝑎 𝑍𝑀 𝐼𝑎
=
𝑉𝑏 𝑍𝑀 𝑍𝑏 𝐼𝑏
• The coefficient
matrix is
symmetrical.
• The currents 𝐼𝑎 and
𝐼𝑏 are positive when
they enter the dots.

AN Legesse, PhD 21
 2.2 Mutually Coupled Branches
in 𝑌𝐵𝑈𝑆 …
• The inverse of the primitive impedance matrix gives the
primitive admittance matrix as:
𝑍𝑎 𝑍𝑀 −𝟏 𝟏 𝑍𝑏 −𝑍𝑀 𝑌𝑎 𝑌𝑀
= =
𝑍𝑀 𝑍𝑏 𝒁𝒂 𝒁𝒃 − 𝒁𝑴𝟐 −𝑍
𝑀 𝑍𝑎 𝑌𝑀 𝑌𝑏
• The nodal admittance equations become
𝑌𝑎 𝑌𝑀 𝑉𝑎 𝐼𝑎
=
𝑌𝑀 𝑌𝑏 𝑉𝑏 𝐼𝑏
• 𝑌𝑎 is self-admittance and
• 𝑌𝑀 is mutual admittance
• Since, 𝑉𝑎 = 𝑉𝑚 − 𝑉𝑛 and 𝑉𝑏 = 𝑉𝑝 − 𝑉𝑞 , we can write the voltage
drop equations as:

AN Legesse, PhD 22
2.2 Mutually Coupled Branches in
𝑌𝐵𝑈𝑆 …

• Similarly,

AN Legesse, PhD 23
2.2 Mutually Coupled Branches in
𝑌𝐵𝑈𝑆 …
• Substituting:

𝑽𝒎
𝑌𝑎 𝑌𝑀 𝑽𝒏 𝑰𝒂
A 𝑽 =
𝑌𝑀 𝑌𝑏 𝒑 𝑰𝒃
𝑽𝒒
• Multiplying both sides of this equation by the matrix 𝐴𝑇

𝑽𝒎 𝑰𝒎
𝑌𝑎 𝑌𝑀 𝑽𝒏 𝑰𝒏
𝑨𝑻 A 𝑽 = 𝑰
𝑌𝑀 𝑌𝑏 𝒑 𝒑
𝑽𝒒 𝑰𝒒

AN Legesse, PhD 24
 2.2 Mutually Coupled Branches
in 𝑌𝐵𝑈𝑆 …
• Further simplifying gives us the nodal admittance equations
of the two mutually coupled branches in the matrix form:

AN Legesse, PhD 25
2.2 Mutually Coupled Branches in
𝑌𝐵𝑈𝑆 …
• Thus, the primitive admittance matrix is

AN Legesse, PhD 26
 2.2 Mutually Coupled Branches in
𝑌𝐵𝑈𝑆 … Example
Example: Two branches having
admittances equal to –j6.25 per
unit are coupled through mutual
admittance 𝑌𝑀 = j 3.75 per unit,
as shown in the figure. Find the
nodal admittance matrix for the
mutually coupled branches and
write the corresponding nodal
admittance equations.

AN Legesse, PhD 27
2.2 Mutually Coupled Branches in
𝑌𝐵𝑈𝑆 … Example
Solution
−𝑗6.25 𝑗3.75
• The primitive admittance matrix is .
𝑗3.75 −6.25
• The rows and columns of the building-block matrix which
multiplies the primitive self-admittances between nodes 1
and 3, are labeled 3 and 1 as the dot is at 3.
• The rows and columns of the building-block matrix which
multiplies the primitive self-admittances between nodes 2
and 3, are labeled 3 and 2 as the dot is at 3.
• Thus, the 4x4 array looks like

AN Legesse, PhD 28
2.2 Mutually Coupled Branches in
𝑌𝐵𝑈𝑆 … Example

AN Legesse, PhD 29
 2.2 Mutually Coupled Branches
in 𝑌𝐵𝑈𝑆 … Example
• Since there are only three nodes, the required 3x3 matrix is
obtained by adding the columns and rows of common node 3
as

AN Legesse, PhD 30
2.2 Mutually Coupled Branches in
𝑌𝐵𝑈𝑆 … Example
• The three nodal admittance equations in vector form are
written as

• 𝑉1 , 𝑉2 𝑎𝑛𝑑 𝑉3 are node voltages.

• 𝐼, 𝐼2 𝑎𝑛𝑑 𝐼3 are injected currents to the corresponding nodes.

AN Legesse, PhD 31
AN Legesse, PhD 32
AN Legesse, PhD 33
AN Legesse, PhD 34
AN Legesse, PhD 35
AN Legesse, PhD 36
AN Legesse, PhD 37
AN Legesse, PhD 38
AN Legesse, PhD 39
AN Legesse, PhD 40
AN Legesse, PhD 41
AN Legesse, PhD 42
AN Legesse, PhD 43
AN Legesse, PhD 44
AN Legesse, PhD 45
AN Legesse, PhD 46
AN Legesse, PhD 47
AN Legesse, PhD 48
AN Legesse, PhD 49
AN Legesse, PhD 50
AN Legesse, PhD 51
AN Legesse, PhD 52
AN Legesse, PhD 53
AN Legesse, PhD 54
AN Legesse, PhD 55
AN Legesse, PhD 56
AN Legesse, PhD 57
AN Legesse, PhD 58
AN Legesse, PhD 59
AN Legesse, PhD 60
AN Legesse, PhD 61
AN Legesse, PhD 62
AN Legesse, PhD 63
AN Legesse, PhD 64
AN Legesse, PhD 65
AN Legesse, PhD 66
 System of Linear Equations
• A linear system of equations is given as

• In matrix form 𝐀𝐱 = 𝐂
o X is an n-dimensional vector the elements of which represent the solution
of the equations.
o C is the constant vector of the system of equations and
o A is the matrix of the system's coefficients.
AN Legesse, PhD 67
 System of Linear Equations….

• The Solution is
𝐗 = 𝐀−𝟏 𝐂
• Methods that enable us to find the solution without finding
the inverse of the matrix:
1. Gauss Elimination
2. Gauss-Jordan Elimination
3. LU Decomposition
4. Tri-diagonal Systems of Linear Equations
5. Iterative methods

AN Legesse, PhD 68
 Gauss Elimination

• Set the augmented matrix first:

AN Legesse, PhD 69
 Gauss Elimination…

• Reduce the augmented matrix to through elementary row

operations:

AN Legesse, PhD 70
 Gauss Elimination…

• Back substitution

• Example: Solve

AN Legesse, PhD 71
 Gauss-Jordan Elimination

• We begin with

• We will treat the elements of the unit matrix as we do the

elements of the constant vector C.
• Eliminate all off diagonal elements.

AN Legesse, PhD 72
 Gauss-Jordan Elimination…
• Finally, we have

• The final elements of B are the elements of the inverse matrix

of A.
• The solution is
𝑐𝑖′
𝑥𝑖 = ′
𝑎𝑖𝑖

AN Legesse, PhD 73
 Gauss-Jordan Elimination…

• Example: Solve the following system of equations using GJ

method.

AN Legesse, PhD 74
 LU Decomposition-- The Crout
Method
• Consider two triangular matrices U and V with the following
properties:

• A = VU
• The system of equations can be rewritten as
𝑨𝒙 = 𝑪 = 𝑽(𝑼𝒙)
• The solution is
𝒙 = 𝑼−𝟏 (𝑽−𝟏 𝑪 )

AN Legesse, PhD 75
 LU Decomposition-- The Crout
Method …
• The matrices U and V can be found from the matrix A in a
fairly simple way by:

• And the solution is

AN Legesse, PhD 76
 LU Decomposition-- The Crout
Method …
• Example: Solve

AN Legesse, PhD 77
 LU Decomposition-- The Crout
Method …
Solution

• C = (12, 24, 36)

• Carrying out the factoring process specified by equations column by
column:

AN Legesse, PhD 78
LU Decomposition-- The Crout
Method …

AN Legesse, PhD 79
 LU Decomposition-- The Crout
Method …
• Make sure that

• The new c’s are

AN Legesse, PhD 80
 LU Decomposition-- The Crout
Method …
• The solution is

AN Legesse, PhD 81
 Tri-diagonal Systems of Linear
Equations
• All the methods described so far generally require about n3
operations.
• A tri-diagonal system of equations looks like:

AN Legesse, PhD 82
 Tri-diagonal Systems of Linear
Equations…
• A straight Gauss elimination would only be involved in one
subtraction below the diagonal normalization element and so
would reach its 'triangular' form after n steps.
• Since the resulting equations would only contain two terms,
the back substitution would also only require two steps
meaning that the entire process would require something of
the order of 3n steps for the entire solution.
• This is so very much more efficient than the general solution
and equations of this form.
• 𝑌𝐵𝑢𝑠 𝑉𝐵𝑢𝑠 = 𝐼𝐵𝑈𝑆 can sometimes be rearranged as a tri-
diagonal system of equations.

AN Legesse, PhD 83
 Iterative Methods

• Some of the methods are

• Jacobian
• Gauss-Seidel
• Newton-Raphson
• Fast Decoupled
• We will discuss them in Chapter 4.
AN Legesse, PhD 84
AN Legesse, PhD 85