1

I. Newton-Raphson Method - 2 dim case

=
=
2 2 1 2
1 2 1 1
) , (
) , (
K x x f
K x x f
Given
2
1 2 1
x x K K and find , and

Guess a Solution,
(0)
2
(0)
1
and X X ,


) , (
) , (
(0)
2
(0)
1 2
(0)
2
(0)
1 1
X X f
X X f

Calculate :



Mismatch:

2 2
(0)
2 1
(0)
1 2 2
1 2
(0)
2 1
(0)
1 1 1
) , (
) , (
K x x x x f x
K x x x x f x
= A + A + A
= A + A + A

Linear Approximation of LHS:

2
(0)
2
0 2
2 (0)
1
0 1
2 (0)
2
(0)
1 2
1
(0)
2
0 2
1 (0)
1
0 1
1 (0)
2
(0)
1 1
) , (
) , (
K x
x
f
x
x
f
x x f
K x
x
f
x
x
f
x x f
= A
c
c
+ A
c
c
+
= A
c
c
+ A
c
c
+

So,

) , (
) , (
(0)
2
(0)
1 2 2
(0)
2
(0)
1 1 1
(0)
2
(0)
1
0 2
2
1
2
2
1
1
1
x x f K
x x f K
x
x
x
f
x
f
x
f
x
f

=
A
A
c
c
c
c
c
c
c
c


J acobian evaluated at
(0)
2
(0)
1
, x x



(0)
2
(0)
1
(0)
2
(0)
1 ) 0 (
K
K
x
x
J
A
A
=
A
A


| |
(0)
2
(0)
1
) 1 (
) 0 (
(0)
2
(0)
1
K
K
J
x
x
A
A
=
A
A

Then set:

A + =
A + =
(0)
2
(0)
2
(1)
2
(0)
1
(0)
1
(1)
1
x x x
x x x

Now, Calculate:

) , (
) , (
(1)
2
(1)
1 2 2
(1)
2
(1)
1 1 1
) 1 (
, 2
2
1
2
2
1
1
1
(1)
2
(1)
1
(1)
2
(1)
1
x x f K
x x f K
x
f
x
f
x
f
x
f
x
x
x x

c
c
c
c
c
c
c
c
=
A
A


) , (
) , (
2 2
1 1
(0)
2
(0)
1
(0)
2
(0)
1
X X f K
X X f K

2
Keep on for
(k)
1
x A , k=0,1,2,3..
Until the algorithm converges, i.e. stop
At a k
th
iteration when:

tolerance) small very some (For

(k)
2
(k)
1
(k)
2
(k)
1

<
<
x x f K
x x f K
, (
, (
2 2
1 1

NR Algorithm normally converges in 3-5 iterations but, each iteration requires the evaluation of
J
-1
, which is time-consuming for large matrix (Sparaty techniques).

Previous Example


2 2 23 1 2 12 2 1 2
1 1 13 2 1 12 2 1 1
) sin( ) sin( ) ( ), (
) sin( ) sin( ) ( ), (
P B B f
P B B f
= + =
= + =
u u u u u
u u u u u


II. Jacobian of functions of several variables:

=
=
0 ) ,..... , (
.
.
.
0 ) ,..... , (
2 1
2 1 1
n n
n
x x x f
x x x f
Scalar Form
Vector form : f(x) =0
f(x) =0 or f
i
(x) =0, I=1,2,.n

n
n n
n
n
n
n n
n n
n
n
n
x
x f
x
x f
x
x f
x
x f
x
x f
x
x f
x J
where
t o h x X J x f x x f
So
terms
order Higher
For
x
x
x f
x
x
x f
x f x x f
x
x
x f
x
x
x f
x f x x f
c
c
c
c
c
c
c
c
c
c
c
c
=
+
+ A + = A
+ +

A
c
c
+ + A
c
c
+ = A
A
c
c
+ + A
c
c
+ = A
) (
. . . .
) (
. .
. .
. .
.
) (
) (
. . .
) ( ) (
) (
. . ) ( ) ( ) , (
,
) (
.......
) (
) ( ) , (
. . .
. . .
. . .
) (
.......
) (
) ( ) , (
1
1
2
1
2
1
1
1
1
1
1
1
1
1
1
1

J abobian matrix of Partial derivatives
3

III. Applying N-R Method to power flow equations
* J acobian of full load flow Eq:

Example:
N-R Method:
| |
(k)
n
(k)
2
(k)
1
(k)
n
(k)
2
(k)
1
.
.
K
K
K
J
x
x
x
k
A
A
A
=
A
A
A
) 1 (
) (
.
.


Need to evaluate [J
(k)
] and then [J
(k)
]
-1

V,o given:

Jacobian buses
Q P
V
V
Q Q Q
V
P P P
V
P P P
Q
P
P
bus bus
example
Bus
bus
slack
Bus

A
A
A
c
c
c
c
c
c
c
c
c
c
c
c
c
c
c
c
c
c
=
A
A
A
|
|
|
.
|

\
|
|
|
|
.
|

\
|
+
,
3 , 2
3
1
2
3
2
2
2
3
2
2
2
2
3
3
3
2
3
2
2
3
2
2
2
2
3
2
o
o
o o
o o
o o


IV. Applying N-R Method to Power Flow Equations:
(PF2)

{ }
{ } ) cos( ) sin(
,..., 1
) sin( ) cos(
1
1
k i ik k i ik k
n
k
i i
k i ik k i ik k
n
k
i i
B G V V Q
n i
B G V V P
o o o o
o o o o
- =
=
+ - =

=
=


P
i
,Q
i
can be regarded as functions:

=
=
) , (
) , (
v Q Q
v P P
i i
i i
o
o

Take o
1
as the ref. o
1
=0, V
1
given
Right hand side are functions of o
2
, o
3
,.., o
n
and V
2
, V
3
,..,V
n

For case I. All P,Q buses except the 1
st
bus

{ }
{ }
) (
) cos( ) sin(
) cos( ) sin(
1
Summation No i k
B G V V
P
B G V V
P
k i ik k i ik k i
k
i
k i ik k i ik k
n
i k
k
i
i
i
=
- =
c
c
+ - =
c
c

=
=
o o o o
o
o o o o
o


4

{ }
{ }
i k
B G V
V
P
B G V G V
V
P
k i ik k i ik i
k
i
k i ik k i ik
n
i k
k
k ii i
i
i
=
+ =
c
c
+ + =
c
c

=
=
) sin( ) cos(
) sin( ) cos( 2
1
o o o o
o o o o



{ }
{ } ) cos( ) cos(
) sin( ) cos(
1
k i ik k i ik k i
k
i
k i ik k i ik k
n
i k
k
i
i
i
B G V V
Q
B G V V
Q
o o o o
o
o o o o
o
- =
c
c
+ - =
c
c

=
=



{ }
{ } ) cos( ) sin(
) cos( ) sin( 2
1
k i ik k i ik i
k
i
k i ik k i ik
n
i k
k
k ii i
i
i
B G V
V
Q
B G V B V
V
Q
o o o o
o o o o
+ =
c
c
+ =
c
c

=
=


For case 1, all load buses, except bus 1 (slack) the J acobian for Newton-Raphson:


equations n
Q V V Q
equations n
P V V P
x x x
i n n i
i n n i
n

n 2,....., i

n 2,....., i
) 1 ( 2
,........, , ,...., (
) 1 ( 2
,........, , ,...., (
2 2
2 2
) 1 ( 2 1

= =

= =

+ + + +
_
_

. . . .
o o
o o

or

=
=
=
=
=
n n
n n
Q x Q
Q x Q
P x P
P x P
k x f
) (
.
.
) (
) (
.
.
) (
) (
2 2
2 2



5

v
v
v v
v v
v v
v v
v v
v v
o
o
o
o
o
o
(
(
(
(
(

c
c
c
c
c
c
c
c
=
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(

c
c
c
c
c
c
c
c
c
c
c
c
c
c
c
c
=
c
c
x x
x x
x
n
n
x
n
x x
x
n
n
x
n
x
n
x
V
Q Q
V
P P
V
Q Q
V
Q Q
V
P P
V
P P
x
x f
.
. .
.
.
. .
.



. . . . . . . . . .



) (
2
2
2
2
2
2
2
2
2



| |
| | ) ( ) (
) ( ) (
) (
) (
. . . . .
) (
) (
1 1
1 1
2 2
2 2
1
2
2
1
1
2
1
1
2
v v v v
v v v v
v
v
v
v
v
v
v
v
v
v
v
v
v o
o
o
o
o
o
x f k x J x x x
x f k x J x x
x Q Q
x Q Q
x P P
x P P
V
Q Q
V
P P
V
V
V
V
n n
n n
x
n
n
n
n
+ = A =
+ =
(
(
(
(
(
(
(
(
(
(

(
(
(
(
(

c
c
c
c
c
c
c
c
+ =
+
+

+
+
+
+
.
.
.
.
.
.


VII. Fast Decoupled Power Flow (FDLF method for the solution of PF 2)


small Elements
) sin( p
2 1 12 2 1
o
o o
o
o
c
c
c
c
=
(
(
(
(
(

c
c
c
c
c
c
c
c
=
c
c

Q
and
V
P
B V V
V
Q Q
V
P P
x
f

. . .

6
hence,

(
(
(
(
(

c
c
c
c
~
c
c
V
Q
P
x
f

. . .

0
0
o

So Newton-Raphson iteration:

|
|
|
.
|

\
|
A
A
=
|
|
|
.
|

\
|
A
A
|
|
|
|
|
.
|

\
|
c
c
c
c
|
|
|
.
|

\
|
A
A
=
|
|
|
.
|

\
|
A
A
|
|
|
|
|
.
|

\
|
c
c
c
c
c
c
c
c
Q
P
V
V
Q
P
by ed approximat be can
Q
P
V
V
Q Q
V
P P
. .

. . .

. .

. . .

o
o
o
o
o
0
0


Of (PF2) is used, then the approximation applies to the iterations only. Since the mismatch will be
checked for convergence. The final solution should be same or close to the N-R solution
previously described.

Further Approximations

(small) e susceptanc shunt of Sum

\
|
=
~
~
- =
- =
= =

+ - =
c
c

=
=
=
=
=
=

=
=
n
k
ik
ii i
n
k
ii ik i
n
k
ii i
small
ik i
k i
ii i ik k
n
k
i
ik k
n
i k
k
i
ik
k i ik k i ik k
n
i k
k
i
i
I
B
B V B B V
B V B V
V V
B V B V V
B V V
G
B G V V
P
_ _
o o o o
o
7
Similarly,


ik i
ik
k i ik k i ik i
k
k
i
ik k i
ik
k i ik k i ij k i
k
k
i
ii i
n
k
ii i
small
ik k ii i
n
i k
k
ik k ii i
ik
n
i k
k
k i ik k i ik k ii i
i
i
B V
G
B G V
V
Q
B V V
G
B G V V
P
B V
B V B V B V
B V B V
G
B G V B V
V
Q
=
= =

)

=
c
c
=
= =

)

=
c
c
=
+ =
=
= =

+ =
c
c

=

=
=
=
=
=
=

1 ) 0 ( 0
) cos( ) sin(
1 ) 0 ( 0
) cos( ) sin(
2
2
1 ) 0 ( 0
) cos( ) sin( 2
) 1 (
) 1 (
1
1
1
_ _
_ _

_ _
o o o o
o o o o
o
o o o o


Matrix Form











To check,
nn n
n
n
B B
B B B
B
V
V
V
V
V B V
P

. .
. .
. .

2
2 23 22
3
2
, ] [
] [ ] [
= =
=
c
c
o
8

0 0
0
0
0 0 0
i
i i
i
i
V
V V
V
Q
=
=
c
c
.
.
B


)
`

A = A
A = A

= =
c
c
=
c
c
=
) ( ] [
) ( ] [ ] [
||
0 0
] [
2
) (
v v v
v v v v
o
x Q V B V
x P V B V
B V
B V
B V
B V
I
V
V
Q
B V
V
Q
ik i
nk i
ik i
k i
i
i k
k
i


Further Approximation,

_ _

scaled diagonal
x Q x Q V V B
x P x P V B
x Q V B V
x P B V
) ( ) ( ] [
) ( ) ( ] [
) ( ] [
) ( ] [
~
1 ) (
~
1 ) (
) (
) (
v v v v
v v v v
v v v
v v v
o
o
A = A = A
A = A = A

|
|
.
|

\
| =

A = A
A = A

buses load
n , 2, n
K assumes This

B does not change over the iteration
Therefore can be computed before the iteration.

9

Fast Decoupled Power Flow


Ex.

|
|
.
|

\
| A
= A
=
A
A

=
A
A

A
= A
A
A
=
A
A

A
= A
A
A
=
A
A

+ =

u
u
u
u
u u
u
u
u
u
u
o o o
3
3
3
3
3
2 1
3
2
3
3
3
3
3
2
3
2
3
3
3 33
3
3
2
3
2
33 32
23 22
3 3 2
2
3 2 3 3 3 3 3
0501 . 0
,.... 2 , 1 , 0
05 . 1
98 . 19 10
10 98 . 19
98 . 19
05 . 1
98 . 19 10
10 98 . 19
) (
05 . 1
, ,
] 98 . 19 ) cos( 5 . 10 cos 10 [
V
Q
V
V
P
P
V
Q
V
V
P
P
V
Q
V B
V
P
P
B B
B B
equations Q P P Needs
V V V Q

0
1
0 0 . 1
1
Z = V
S
G
98 . 19
10
05 . 1
666 . 0
2
2
=
=
=
=
ii
ij
G
B
B
V
P


2244 . 1
8653 . 2
2244 . 1 8653 . 2
3
3
3
=
=
+
Q
P
j
V