EE 4006

Power and Electric Distribution

Systems Design Capsule
Lecture #17
18.11.2024

Instructor: Alper Savaşcı, PhD

Outline
• Iterative Solutions To Nonlinear Algebraic
Equations:
• Newton-Raphson Method

• Bus Admittance Matrix (Ybus)

2
 Iterative Solutions To
Nonlinear Algebraic
Equations: Newton-Raphson
• A set of nonlinear algebraic equations • The iterative methods described in
in matrix format is given by the previous section can be extended
to nonlinear equations as follows.
Rewrite y = f(x) as

Adding Dx to both sides of the above

equation

where y and x are N vectors and f(x) is

an N vector of functions.
Premultiplying by D−1

3
 new values
old values

For linear equations, f(x) = Ax

which is identical to the Jacobi

and Gauss-Seidel methods.

4
• For nonlinear equations, the matrix D must be specified.
• The Newton-Raphson method is one of the methods that can be used
based on the following Taylor series expansion of f(x) about an operating
point x0.

• Neglecting the higher order terms and solving for x,

5
• The Newton-Raphson method replaces x0 by the old value x(i) and x by the
new value x(i + 1) as follows

Jacobian Matrix

6
 Basically, the question asks for the solution of .

(a) For N-R, the update eqn is

J=
𝑑𝑓
𝑑𝑥 |𝑥= 𝑥(𝑖)
=
𝑑
𝑑𝑥
( 𝑥2) |
𝑥=𝑥 (𝑖 )
=2 𝑥 (𝑖)

1
𝑥 ( 𝑖+1 ) =𝑥 ( 𝑖 ) + {9 − 𝑥 2 (𝑖) }
2 𝑥 (𝑖)

i 0 1 2 3 4 5
xi 1 5 3.4 3.023529 3.00009 3.00000
7
(b) Extended Gauss-Seidel with until the termination criteria is satisfied for .

1
𝑥 ( 𝑖+1 ) = 𝑥 ( 𝑖 ) +
3
{ 9 − 𝑥 2 (𝑖) }

• As shown, Gauss–Seidel
oscillates about the solution,
slowly converging, whereas
Newton–Raphson converges in
five iterations to the solution
x=3. Note that if x(0) is negative,
Newton–Raphson converges to
the negative solution x = –3.
• Also, it is assumed that the
matrix inverse J–1 exists. Thus,
the initial value x(0) = 0 should
be avoided for this example.

8
Form the Jacobian

[ ]|
𝜕𝑓 1 𝜕𝑓1

J ( 𝑖 )=
𝜕 𝑥1
𝜕𝑓 2
𝜕 𝑥2
𝜕𝑓2
= 1
𝑥2[ 1
𝑥1 ]| x = x ( 𝑖)
=
[ 1
𝑥 2 (𝑖)
1
𝑥 1( 𝑖) ]
𝜕 𝑥1 𝜕 𝑥2 x = x (𝑖 )

J− 1 ( 𝑖) =
1
𝑥 1 ( 𝑖 ) − 𝑥 2 (𝑖) ([ 𝑥 1 (𝑖)
− 𝑥 2 (𝑖)
−1
1 ]) 9
 Form the Jacobian

[ ]|
𝜕𝑓 1 𝜕𝑓1

J ( 𝑖 )=
𝜕 𝑥1
𝜕𝑓 2
𝜕 𝑥2
𝜕𝑓2
= 1
𝑥2 [ 1
𝑥1 ]|
x = x ( 𝑖)
=
[ 1
𝑥 2 (𝑖)
1
𝑥 1( 𝑖) ]
𝜕 𝑥1 𝜕 𝑥2 x = x (𝑖 )

J− 1 ( 𝑖) =
1
𝑥 1 ( 𝑖 ) − 𝑥 2 (𝑖) ([ 𝑥 1 (𝑖)
− 𝑥 2 (𝑖)
−1
1 ])
𝐱 ( 𝑖+1 ) = 𝐱 ( 𝑖 ) +
1
𝑥 1 (𝑖 ) − 𝑥 2 (𝑖) ([ 𝑥 1 (𝑖)
− 𝑥 2 (𝑖)
−1
1 ])([ ] [ 15 − 𝑥 1 (𝑖)+ 𝑥2 (𝑖)
50 𝑥 1 (𝑖) 𝑥 2 (𝑖) ])
¿
[ ]
𝑥 1 (𝑖)
+
1
[
𝑥 1 ( 𝑖 ) ⋅ ( 15− 𝑥1 ( 𝑖 ) − 𝑥 2 ( 𝑖 ) ) − ( 50 − 𝑥1 ( 𝑖 ) 𝑥 2 ( 𝑖 ) )
𝑥 2 (𝑖) 𝑥 1 ( 𝑖 ) − 𝑥 2( 𝑖) − 𝑥 2 ( 𝑖 ) ⋅ ( 15− 𝑥1 ( 𝑖 ) − 𝑥 2 ( 𝑖 ) ) + ( 50 − 𝑥 1 ( 𝑖 ) 𝑥2 (𝑖) ) ]
10
i 0 1 2 3 4
4 5.2 4.9913 4.9999 5.0000
9 9.8 10.0087 10.000 10.0000

11
 The Power Flow Problem
• The power flow problem is the computation of voltage magnitude and
phase angle at each bus in a power system under balanced three-phase
steady-state conditions.
• Using this calculation, real(P) and reactive(Q) power flows in equipment
such as transmission lines and transformers, as well as equipment losses,
can be computed.
• The starting point for a power flow problem is a single-line (one-line)
diagram of the power system, from which the input data can be obtained.
Input data consists of
one-line) diagram of 4-bus power system
• bus data,
• transmission line data, and
• transformer data
• shunt capacitor or reactor data.

12
 one-line) diagram of 4-bus power system

Net Power Injection

to the Grid

• At each bus, two of these variables are specified as input data, and the other
two are unknowns to be computed by the power flow program.
• Note that when bus k is a load bus with no generation, Pk = –PLk is negative;
that is, the real power supplied to bus k in Figure 6.1 is negative. If the load
is inductive, Qk = –QLk is negative.

13
 Power Flow Input Data |
Bus Types
Each bus k is categorized into one of the following three bus types:
1. Swing bus (or slack bus)
• There is only one swing bus, generally numbered bus 1.
• The swing bus is a reference bus for which , is input data with the angle
typically zero degrees and the voltage magnitude close to 1.0 per unit.
• The power flow computes P1 and Q1.
2. Load (PQ) bus
• and are input data.
• The power flow computes and .
• Most buses in typical power flows are load buses.
3. Voltage controlled (PV) bus
• and are input data.
• The power flow program computes and .
• Examples are buses to which generators, switched shunt capacitors, or
static var systems are connected.

14
 Power Flow Input Data | Branch
• Input data for each transmission line • Input data for each transformer include
include • per-unit winding impedances Z
• the per-unit equivalent circuit series • the per-unit exciting branch
impedance Z’ and shunt admittance Y’ admittance Y
• the buses to which the windings are
connected, and
• maximum MVA ratings

• the two buses to which the line is

connected and
• maximum MVA rating
• Input data for tap-changing
transformers also include maximum
tap settings.

15
 BUS DATA TABLE

*Sbase = 100 MVA, Vbase = 15 kV at buses 1, 3, and 345 kV at buses

2, 4, 5

16
 BRANCH DATA TABLE

*Sbase = 100 MVA, Vbase = 15 kV at buses 1, 3, and 345 kV at

buses 2, 4, 5

17
 TRANSFORMER
DATA TABLE

*Sbase = 100 MVA, Vbase = 15 kV at buses 1, 3, and 345 kV

at buses 2, 4, 5

18
 The bus admittance matrix | YBUS MATRIX
• Electric networks can be fully represented by YBUS matrix

[ ]
𝑌11 𝑌 12 ⋯ ⋯ ⋯𝑌 1𝑁
• Its diagonal element Ykk
𝑌 21 𝑌 22 ⋯ ⋯ ⋮𝑌 2𝑁
is the nodal self-
𝒀= ⋯ ⋯ 𝑌 𝑘𝑘 ⋯ 𝑌 𝑘𝑛
⋯ admittance
⋮ ⋮ ⋮ ⋱ ⋮ ⋮
⋮ ⋮ ⋮ ⋮ ⋱ ⋮ • The off-diagonal
𝑌𝑁1 𝑌𝑁2 ⋯ ⋯ ⋯𝑌 𝑁𝑁 element Ykn is the
mutual admittance
between bus k and bus
Diagonal elements: Ykk = sum of admittances
n. connected to bus k
Off-diagonal elements: Ykn = ( sum of admittances connected
between buses k and n k )

19
YBUS Matrix Formation | Basics

[ ]
𝑌 11 𝑌 12 𝑌 13 𝑌 14 𝑌 15
𝑌 21 𝑌 22 𝑌 23 𝑌 24 𝑌 25
𝐘 𝐁𝐔𝐒= 𝑌 31 𝑌 32 𝑌 33 𝑌 34 𝑌 35
𝑌 41 𝑌 42 𝑌 43 𝑌 44 𝑌 45
𝑌 51 𝑌 52 𝑌 53 𝑌 54 𝑌 55

20
 [ ]
𝑌 11 𝑌 12 𝑌 13 𝑌 14 𝑌 15
𝑌 21 𝑌 22 𝑌 23 𝑌 24 𝑌 25
𝐘 𝐁𝐔𝐒= 𝑌 31 𝑌 32 𝑌 33 𝑌 34 𝑌 35
𝑌 41 𝑌 42 𝑌 43 𝑌 44 𝑌 45
𝑌 51 𝑌 52 𝑌 53 𝑌 54 𝑌 55

Diagonals Off-Diagonals

𝑌 45 =𝑌 54 =0

Bus admittance matrix is generally symmetric.

21
22
23
SERIES Components

1 5 4 3
𝑦 15 𝑦 45 𝑦 34
𝑠h 𝑠h
𝑦 45 𝑦 45
𝑠h 𝑠h
𝑦 25 𝑦 24
𝑦 25 𝑦 24 Single-line
𝑠h equivalent
𝑦 25
𝑠h
𝑦 24
circuit
2
1 1
𝑦 15 = = =3.7290 − 𝑗 49.7203 p .u .
𝑧 15 0.0015+ 𝑗 0.02

1 1
𝑦 24 = = = 0.8928 − j 9.9197 p . u .
𝑧 24 0.0 09+ 𝑗 0.1

1 1
𝑦 25 = = = 1.7855− 𝑗 19.8393 p .u .
𝑧 25 0.0 045 + 𝑗 0. 05
1 1
𝑦 34= = =7.4580 − 𝑗 99.4406 p . u .
𝑧 34 0.00 07 5+ 𝑗 0.01
1 1
𝑦 45= = =3.5711 − 𝑗 39.6786 p . u .
𝑧 45 0.00 225 + 𝑗 0.025 24
SHUNT Components

1 5 4 3
𝑦 15 𝑦 45 𝑦 34
𝑠h 𝑠h
𝑦 45 𝑦 45
𝑠h 𝑠h
𝑦 25 𝑦 24
𝑦 25 𝑦 24 Single-line
𝑠h equivalent
𝑦 25
𝑠h
𝑦 24 circuit
2

𝑠h 𝐵 25 1.72
𝑦 25 = j =j = j 0. 86 p .u . : Total Line Susceptance
2 2

𝑠h 𝐵 24 0.88
𝑦 24= j =j = j 0. 44 p . u .
2 2

𝑠h 𝐵 45 0.44
𝑦 45= j =j = j 0. 22 p . u .
2 2

25
 Diagonals Part-I

@ bus 1

𝑦 240 = j 0. 86 p . u .
𝑦 450 = j 0. 22 p .u .
@ bus 2 𝑦 250 = j 0. 44 p .u .

@ bus 3

26
 Diagonals Part-II

@ bus 4

@ bus 5

Shunts 𝑠h
𝑦 25 = j 0. 86 p . u .
𝑠h
𝑦 24 = j 0. 22 p . u .
𝑠h
𝑦 4 5 = j 0. 44 p . u . 27
Complete Ybus Matrix

28