Professional Documents
Culture Documents
Announcements
* *
Y
V
V
Y
ik k
i ikVk
k 1
k 1
Rather, we must pursue an iterative approach.
Si Vi I i*
Vi
Gauss Iteration
There are a number of different iterative methods
we can use. We'll consider two: Gauss and Newton.
With the Gauss method we need to rewrite our
equation in an implicit form: x = h(x)
To iterate we first make an initial guess of x, x (0) ,
and then iteratively solve x (v +1) h( x ( v ) ) until we
find a "fixed point", x,
such that x h(x).
(v )
x
1
2
2.41421
2.55538
2.59805
k
5
6
7
8
9
(v)
x
2.61185
2.61612
2.61744
2.61785
2.61798
5
Stopping Criteria
A key problem to address is when to stop the
iteration. With the Guass iteration we stop when
with x ( v ) @x ( v 1) x ( v )
x ( v )
x
i
i 1
x max i x i
6
S*i
*
Vi
*
Vi I i
n
* *
Y
V
V
Y
ik k
i ikVk
k 1
k 1
Vi
Vi
YikVk
k 1
YikVk
k 1
YiiVi
Vi
n
k 1,k i
1 S*i
Vi
* YikVk
Yii V
k
1,
k
YikVk
k 1
YikVk
SLoad =1.0+j0.5p.u.
5 j14.95 5 j15
j
15
5
j
14.70
1 S*2
V2
* YikVk
Y22 V2 k 1,k i
-1 j 0.5
1
V2
(5 j15)(1.00)
*
5 j14.70
V2
(v )
V2
1.000 j 0.000
0.9671 j 0.0568
0.9624 j 0.0553
v
3
4
(v)
V2
0.9622 j 0.0556
0.9622 j 0.0556
10
11
Slack Bus
In
We can
12
n
1 S*i
(v )* YikVk(v )
Yii V
k
1,
k
i
i
Gauss-Seidel Iteration
Immediately use the new voltage estimates:
V2( v 1) h2 (V1 ,V2( v ) ,V3( v ) ,,Vn( v ) )
V3( v 1) h2 (V1 ,V2( v 1) ,V3( v ) ,,Vn(v ) )
V4( v 1) h2 (V1 ,V2( v 1) ,V3( v 1) ,V4( v ) ,Vn( v ) )
M
Vn( v 1) h2 (V1 ,V2(v 1) ,V3( v 1) ,V4( v 1) ,Vn( v ) )
The Gauss-Seidel works better than the Gauss, and
is actually easier to implement. It is used instead
of Gauss.
14
15
Gauss-Seidel Advantages
Each
16
Gauss-Seidel Disadvantages
Tends
17
Newton-Raphson Algorithm
The
18
(v)
, define
x ( v ) x - x ( v )
2. Represent f ( x ) by a Taylor series about f ( x )
(v)
df
(
x
) (v)
(v)
f ( x ) f ( x )
x
dx
2
1 d f (x
2 dx 2
(v)
(v) 2
19
df ( x )
(v)
x
f (x )
dx
( v 1)
(v)
(v)
20
Newton-Raphson Example
Use Newton-Raphson to solve f ( x) x 2 - 2 0
The equation we must iteratively solve is
x
(v )
(v )
( v 1)
( v 1)
(v)
df ( x )
(v)
f
(
x
)
dx
(v) 2
(( x ) - 2)
( v )
2x
x
(v)
(v)
(v)
1
(v ) 2
2 x (v ) (( x ) - 2)
21
( v 1)
(v)
1
(v) 2
((
x
) - 2)
2 x (v )
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 106
22
Function is f(x) = x2 - 2 = 0.
Solutions are points where
f(x) intersects f(x) = 0 axis
At each
iteration the
N-R method
uses a linear
approximation
to determine
the next value
for x
23
Newton-Raphson Comments
When
close to the solution the error decreases quite quickly -method has quadratic convergence
f(x(v)) is known as the mismatch, which we would like to drive to
zero
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?
A solutions region of attraction (ROA) is the set of initial guesses
that converge to the particular solution. The ROA is often hard to
determine
24
Multi-Variable Newton-Raphson
Next we generalize to the case where x is an ndimension vector, and f (x) is an n-dimension function
x1
x
2
x
M
x
n
f1 ( x)
f 2 ( x)
f n ( x)
f (x)
26
f1 (x)
f 2 (x)
f (x)
2
f (x )
x1
M
M
f ( x )
n
f (x)
n
x1
f1 (x)
L
x2
f 2 (x)
L
x2
O
O
f n (x)
L
x2
f1 (x)
xn
f 2 (x)
xn
M
f n (x)
xn
x1
x
2
M
x
n
Jacobian Matrix
The n by n matrix of partial derivatives is known
as the Jacobian matrix, J (x)
f1 (x)
x
1
f1 (x)
L
x2
f 2 (x)
J (x) x1
f (x)
n
x1
f 2 (x)
L
x2
O
O
f n (x)
L
x2
f1 (x)
xn
f 2 (x)
xn
M
f n (x)
xn
28
29
https://www.misoenergy.org/Library/Repository/Study/MTEP/MTEP11/MTEP11_Draft_Report.pdf
30
31
Black lines are DC, blue lines are 765kV, red are 500 kV
Source: Midwest ISO MTEP08 Report
32