Professional Documents
Culture Documents
NR Power Flow
NR Power Flow
Power Flow
Newton-Raphson Algorithm
The second major power flow solution method is
the Newton-Raphson algorithm.
Key idea behind Newton-Raphson is to use
sequential linearization
Newton-Raphson Method
1. For each guess of x , x (v ) , define
x
(v)
= x - x
(v)
1 d 2 f ( x(v) )
(v )
+
x
2 dx 2
Newton-Raphson Method
3. Approximate f ( x ) by neglecting all terms
except the first two
(v )
(
) (v )
df
x
(v)
f ( x ) = 0 f ( x ) +
x
dx
(v)
(v)
df ( x )
=
dx
f ( x(v ) )
Example
Use Newton-Raphson to solve f ( x ) = x 2 - 2 = 0
The equation we must iteratively solve is
x
(v )
(v )
(v )
df ( x )
=
dx
f ( x (v) )
1
(v) 2
=
x
((
) - 2)
(v )
2x
x ( v +1) = x ( v ) + x ( v )
x
( v +1)
= x
(v )
1
(v ) 2
x
((
) - 2)
(v)
2x
Example Solution
x
( v +1)
= x
Guess x
(0)
(v)
1
(v ) 2
(( x ) - 2)
(v )
2x
v
0
1
x(v)
1
1.5
f ( x(v ) )
1
0.25
x (v )
0.5
0.08333
1.41667
6.953 103
2.454 103
1.41422
6.024 10
Comments
When close to the solution the error decreases
quite quickly -- method has quadratic convergence
Stopping criteria is when f(x(v)) <
Results are dependent upon the initial guess.
What if we had guessed x(0) = 0, or x (0) = -1?
Multi-Variable Newton-Raphson
Next we generalize to the case where x is an ndimension vector, and f (x) is an n-dimension function
x =
x1
f1 (x)
x2
f 2 ( x)
xn
f ( x) =
f n ( x)
f1 ( x )
x2
f1 ( x )
xn
f 2 ( x )
f 2 (x)
+ x1
f (x ) =
f 2 ( x )
x2
f 2 ( x )
xn
f1 ( x )
f n (x)
f n ( x )
x1
f n ( x )
x2
f n ( x )
xn
x1
x2
xn
Jacobian Matrix
The n by n matrix of partial derivatives is known
as the Jacobian matrix, J (x)
J (x) =
f1 (x)
x1
f1 (x)
x2
f1 (x)
xn
f 2 (x)
x1
f 2 ( x)
x2
f 2 (x)
xn
f n (x)
x1
f n (x)
x2
f n (x)
xn
J (x) 1 f (x)
x( v+1) = x( v ) + x( v )
x( v+1) = x( v ) J (x( v ) ) 1 f (x( v ) )
Iterate until f (x( v ) ) <
Example
Solve for x =
x1
x2
f1 ( x ) = 2 x12 + x 22 8 = 0
f 2 ( x ) = x12 x 22 + x1 x 2 4 = 0
First symbolically determine the Jacobian
J (x ) =
f1 ( x )
x1
f1 ( x )
x2
f 2 ( x )
x1
f 2 ( x )
x2
Solution
J (x) =
4 x1
2 x2
2 x1 + x2
x1 2 x2
4 x1
2 x2
2 x1 + x2
x1 2 x2
Then
x1
x2
Arbitrarily guess x
x
(1)
1
1
(0)
f1 (x)
f 2 ( x)
1
1
2
3 1
5
3
2.1
1.3
Solution, contd
(2)
2.1
1.3
8.40
2.60
5.50 0.50
2.51
1.45
1.8284
1.2122
(2)
0.1556
0.0900
= Vi
n
k =1
Yik V k
= Vi
= Vi e
j i
= Vi i
ik = i k
R ecal l e j = cos + j sin
n
k =1
Yik* V k*
n
k =1
jQi = Vi Yik*Vk*
k =1
n
k =1
Vi Vk e
j ik
(Gik jBik )
n
k =1
n
k =1
NR Power Flow
In the Newton-Raphson power flow we use Newton's
method to determine the voltage magnitude and angle
at each bus in the power system.
We need to solve the power balance equations
Pi =
Qi =
n
k =1
n
k =1
x =
P2 (x) PG 2 + PD 2
V2
Vn
f ( x) =
= v +1
v
End While
J (x) =
f1 (x)
x1
f1 (x)
x2
f1 (x)
xn
f 2 (x)
x1
f 2 (x)
x2
f 2 (x)
xn
f n (x)
x1
f n (x)
x2
f n (x)
xn
n
k =1
n
k =1
k i
f i ( x )
= Vi V j (Gik sin ik Bik cos ik ) ( j i )
j
x =
2
V2
Ybus =
j10 j10
j10 j10
n
k =1
n
k =1
J ( x) =
P2 (x)
2
P2 (x)
V 2
Q 2 (x)
2
Q 2 (x)
V 2
10 V2 cos 2
10 V2 sin 2
10sin 2
10 cos 2 + 20 V2
First Iteration
Set v = 0, guess x
(0)
0
=
1
Calculate
f(x
(0)
J (x
V2 (10sin 2 ) + 2.0
)=
(0)
10 V2 cos 2
)=
10 V2 sin 2
Solve x
(1)
10sin 2
=
10 cos 2 + 20 V2
0
10 0
=
1
0 10
2.0
1.0
2.0
1.0
10 0
0 10
0.2
0.9
Next Iterations
0.9 (10sin(0.2)) + 2.0
(1)
f(x ) =
1.986
1.788
8.199
(1)
J (x ) =
x
(2)
f(x
(2)
(3)
0.2
0.9
)=
f(x ) =
8.82
1.986
1.788
8.199
0.0145
0.0190
0.0000906
0.0001175
(3)
Done!
0.212
0.279
0.212
0.279
0.233
0.8586
0.236
0.8554
V2 = 0.8554 13.52
PV Buses
Since the voltage magnitude at PV buses is fixed there
is no need to explicitly include these voltages in x or
write the reactive power balance equations
the reactive power output of the generator varies to
maintain the fixed terminal voltage (within limits)
optionally these variations/equations can be
included by just writing the explicit voltage constraint
for the generator bus
|Vi | Vi setpoint = 0
2
3
f ( x) =
V2
!"
P2 ( x) PG 2 + PD 2
P3 (x) PG 3 + PD 3 = 0
Q2 (x) + QD 2