2nd IEEE International Conference on Power and Energy (PECon 08), December 1-3, 2008, Johor Baharu, Malaysia

Newton-Raphson on Power Flow Algorithm and

Broyden Method in the Distribution System
Hui Yang, Fushuan Wen and Liping Wang
Department of Electrical Engineering, South China University of Technology, Guangzhou , China. Email:
stupid-mu@163.com, fushuan.wen@gmail.com, wangliping023@126.com

AbstractThe application of Newton-Raphson power flow

algorithm in the distribution network is summarized and
analyzed in this paper. The difference between the Newton
Method of distribution network and transmission network
and also the advantages and the disadvantages of Newton
Method of the distribution network is analyzed to discover a
power flow calculation method which has better
convergence and less running time, this method must not
only retain the disadvantage of Newton Method but also
overcome its shortcomings. Then, Because of the advantages
of the Newton Method in the distribution network, the
Broyden Method which has ultra-linear convergence is
introduced in the paper. Without the need to calculate the
Jacobian matrix or only once, it can still avoid the
numerical instability. Thus, this method is better than
Newton Method in the distribution system.
Keywordsdistribution network; Newton-Raphson Method;
power flow calculation; Broyden Method

I. INTRODUCTION

ITH the development of economics, the electric

power system is accelerating in development in
China, and also the distribution networks are becoming
more and more complex, so it is necessary to find one
excellent power flow calculation under this situation.
Newton-Raphson Method is an outstanding power flow
algorithm which has better convergence and higher
precision in the main network [1]. However, in the
distribution network, because of the specialty of the
topology structure of distribution network, the NewtonRaphson Method is not always convergent and the
stability of this method is challenged. Thereupon, many
domestic and foreign scholars advocated Back/Forward
Sweep Method as a power flow calculation method in
distribution network systems. Regarding radial network,
the running time of Back/Forward Sweep Method is
shorter than the one of the Newton-Raphson Method as
its programming is simple. However the Back/Forward
Sweep Method also has some disadvantages, including
the complex numbering and inconvenience. The precision
of the Back/Forward Sweep Method is inferior to that of
the Newton-Raphson Method, and also it only can do the
job well with the PQ buses and the balance bus. If the
This work is jointly supported by National Natural Science
Foundation of China (50477029), and by the Program for New Century
Excellent Talents in University (No. NCET-04-0818).

1-4244-2405-4/08/$20.00 2008 IEEE

Back/Forward Sweep Method is used to process the

network with the PV buses, its precision may be very
different from the Newton-Raphson Method, the complex
of program will also obviously increase, especially in the
system without radial network, its data precision and
programming complexness will be not perfect.
Nowadays, because users have higher requests for
electrical energy quality, PV buses in the distribution
network will be even more than before. If the
Back/Forward Sweep Method is still taken as the core
algorithm, its advantages will disappear. Therefore it is
necessary to find and present a method which has a better
convergence, higher precision and easy numbering, and is
helpful to the power flow analysis in the distribution
network. The paper takes the Broyden method as the core
algorithm of the power flow analysis, which can mostly
overcome the shortcomings of the Newton-Raphson
Method well. The Broyden method has high precision,
better stability and ultra-linear convergence rate.
However, this method has a similar shortcoming with the
Newton-Raphson Method, which has only local
convergence. So using the approximate linear solution as
its initial iteration value, which can fall into the
convergence region easily, effectively makes up the
shortcomings of Broyden method, and as a result the
capability of this algorithm is more superior.
This paper analyzes the advantages and disadvantages
of the Newton-Raphson Method from the mathematical
view, and compares them with the transmission network
and the distribution network. It expounds the shortages of
the Newton-Raphson Method in the distribution network,
with the Broyden method as a core power flow algorithm.
The mathematical model is introduced, the method of
selecting the initial iteration value, and then a detailed
explanation for the Broyden method. The third part gives
the steps of programming, in order to help the readers
understand the concept of computer realization well.
Finally, the paper gives a calculating example to test this
method, and the results are presented in this paper.
II. NEWTON-RAPHSON METHOD IN THE DISTRIBUTION
NETWORK
In the main network, the Newton-Raphson Method is a
power flow algorithm with perfect convergence, but
sometimes in the distribution network, its convergence

1613

2nd IEEE International Conference on Power and Energy (PECon 08), December 1-3, 2008, Johor Baharu, Malaysia

and stability meets the heavy challenge. Many years ago,

it has appeared as a phenomenon that the NewtonRaphson Method was not convergent. In order to solve
this problem in the distribution network, many kinds of
power flow algorithms have been found, such as the Loop
Circuit method, Back/Forward sweep method and so on.
But for the purpose of making the power flow
convergent, many problems came out. For example, for
the Back/Forward sweep method, it often needs
numbering with a certain rule, and also another
consideration for the loop network and PV buses, but the
Newton-Raphson Method do not need such fussy
requirements.
How to resolve the disadvantages in the NewtonRaphson Method? This paper firstly describes the
network topology.
In the main network in China, it usually operates with
the loop network, and the reactance X is much larger than
the resistance R. For this kind of network configuration,
the bus admittance matrix is often a strict diagonally
dominant matrix. The Jacobian matrix from the bus
admittance matrix also does not have singular or large
condition number. Because of many PV buses in the main
network, usually the Newton-Raphson Method is
convergent. However, in the distribution network, this
differs. The topology of the distribution network is a
radial configuration, and usually operates by open
networks with loop design, so the bus admittance matrix
is often not a strict diagonally dominant matrix. Because
there are no loop networks, the self-admittance usually
equals to the sum of two close branches. And for the
distribution network where the voltage level is lower, the
value R/X is much larger, which influences the strict
diagonally dominant matrix. So the Jacobian matrix
which comes from the bus admittance matrix may have
singularity and morbidity. Morbidity refers to the fact that
the condition number of the Jacobian matrix is very large.
When this happens, even the difference between iterative
value and real value is slight, but for this condition
number, the result of the linear equations (the revised
value of voltage) will be very large and the revised
voltage value will differ further from the real value and
even go beyond the attracting region S, leading to the
divergence of the power flow algorithm. If an appropriate
initial iterative value is chosen, it is possible to make the
one which does not diverge, but it cannot thoroughly
resolve the problem which is determined by the essence
of the Newton-Raphson Method.
The Newton-Raphson Method has two advantages:
Firstly, it usually consists of local ultra-linear
convergence. Under some other conditions, the NewtonRaphson Method is at least local quadratic convergence,
which means that each iteration of the Newton-Raphson
Method will make the valid numbers double. That is to
say, if starting from one valid number, it will reach 16
valid numbers after four iterations; secondly, the NewtonRaphson Method usually has an attracting region S. In
another word, as long as the initial approximate value

drops in the attracting region S, then the iterative series

k

{ x } that come from it will not exceed the attracting

region, and converge to a certain solution. Otherwise, the
Newton-Raphson Method is a method with self correction.
That is to say,

x k +1 only depends on function

f and x k , so the error caused from the front iteration

will not accumulate all the time. This advantage of the
Newton-Raphson Method does not exist in the quasiNewton method.
Although the Newton method has high convergence
rates, this is based on the instance of strict iterative initial
value and nonsingular Jacobian matrix. The iterative
initial value does not only affect whether the iteration is
convergent, but also that different iterative initial values
may have different convergent values when the equations
have many solutions, so sometimes it is difficult to
confirm a initial approximate solution x0, which is the
disadvantage of the Newton-Raphson Method. To some
concrete questions, attracting region S may be small. So
the approximate solution must approach the convergent
value, but this is very difficult to do. To overcome this
shortcoming, we can use descent algorithms to develop
the convergent region S. If the Jacobian matrix is singular
or morbid, it may cause the value to be unstable, and as a
result, the numerical computation is defeated. Another
shortcoming of the Newton's method is that it must
k

compute the matrix f ' ( x ) , the vector function f ( x )

in each iteration, and it needs to carry out arithmetic
3

computations with O ( n ) times when solving linear

equations, which causes the running time of program to
be longer.
Sometimes the convergent speed may be very slow
when using the Newton method to compute power flow
in distribution network. When this phenomenon appears,
it may be because there two solutions are the same. This
situation may occur because the present network nodes
increase exponentially, as is the probability of this kind of
phenomenon, but this is the accidental phenomenon after
all.
Usually, there are three measures to enhance the
convergence of the power flow algorithm [2]: 1st,
selecting the more perfect initial iteration value based on
some linear algorithm; 2nd, improve the linear model of
nonlinear equations; 3rd, Expand the convergence region
with the method of optimizing length of step.
Based on the drawback of the Newton Method, this
paper presents a quasi-Newton method (Broyden method)
as the core power flow algorithm. Its main features are
that it need not calculate the Jacobian matrix or only
calculate once, and also need not solve its inverse matrix
or its corresponding linear equations. However, the
approximate inverse matrix of the Jacobian matrix can be
achieved by the successive amendments to the initial
given matrix. This theory proves that: it reduces the
calculations in each iteration from

1614

O(n 3 ) to O(n 2 ) ,

2nd IEEE International Conference on Power and Energy (PECon 08), December 1-3, 2008, Johor Baharu, Malaysia

and the numbers of calling function is only n times.

Although the convergence rate is slightly affected, the
running time has been reduced.
However, Broyden Method and Newton's Method
have a common drawback which is their local
convergence. Because the requirement of their initial
value is higher, an approximate linear iterative solution is
used as the Broyden initial value. Another drawback is
that it cannot be self-corrected, because Bk has relations
with all

The initial iteration voltage amplitude is described as

follows:

[Vm ] = [ Av ] 1 ([Q ]m [ Bv ][P] m+l + [Cv ])

Where: [ Av ] = ([QBa ] [QG][ PB]1[ PGa ]) R mm , and

exiting the unique inverse Matrix;

[ Bv ] = [QG][ PB] 1 R m( m+l ) ;

B j ( j < k ) (where B is iteration matrix), it

may keep the information all the time which is harmful to

the convergence. But it is not necessary to solve the
singularity and morbidity equation, its stability has been
also improved. Next, the basic process of Broyden power
flow algorithm will be introduced.
III. MATHEMATICAL MODEL

[C v ] = ([QG ][ PB] 1 [ PGb ] [QBb ])[V ] n m R m1

The initial iteration value of phase angle is:

[ ] m+l = [ A ] 1 ([ P] m +l [ B ][Q] m + [C ])

[ A ] = ([ PB] [ PGa ][QBa ] 1 [QG ]) R ( m +l )( m +l ) , and

exiting the unique inverse matrix;

m is the number of PQ buses, l is the

number of PV buses, n is the total number of overall
buses in the whole network, and n 1 = m + l ; At the
same time, assuming buses 1 m are PQ buses,
m + 1 ~ m + l are PV buses, and n is the balance

[ B ] = [ PGa ][QBa ] 1 R ( m +l )m ;

[C ] = ([ PGa ][QBa ] 1 [QBb ] [ PGb ])[V ] n m R ( m + l )1

Where:

Q1
#
[Q ]m = [QBa ][V ] m + [QBb ][V ]n m + [QG ][ ] m +l
#

Qm

bus.
A. The Computation for the Iterative Initial Value
Regarding the question of iteration initial value, many
papers have mentioned this topic, and also present many
methods. Usually take Vi =1.0p.u. (= 1, 2, 3... ... n - 1; n
this is a group of more ideal initial values. But this kind
of value can not achieve the convergent solution
sometimes, so some get the iterative initial value after
two iterations with the Gauss-Seidel power flow
calculation method. The paper uses the approximate
linear solution as the iterative initial value of the Broyden
method, the value with this method is quite close to the
real convergent value.
The power flow equations with polar system are
described as:
n

(1)

j =1
n

Qi = Vi V j (Gij sin ij Bij cos ij )

(2)

j =1

Where:

[ P ]m +l

i = 0.0 ( i = 1, 2... ... n), but in fact,

Pi = Vi V j (Gij cos ij + Bij sin ij )

i 12 n 1 ; i n . Gij Bij

ij = i j
bias angle of voltage phase between bus i and bus j .
is the element of admittance matrix;

(4)

Where:

Assuming

is the balanced bus),

(3)

is

P1
#
= [ PG ][V ] + [ PG ][V ] + [ PB][ ]
=
a
m
b
n m
m +l
#

Pm+l

V1
#
[V ] m =
#

Vm

[V ]n m

Vm +1
#

=
#

Vn

G1m
#
#

" " Gm +l ,m
" " B1m
#

" " Bmm

G1,m +1 " " G1n

#
#
[ PGb ] =
#
#

"
"
G
G
m
+
l
,
m
+
1
m
+l ,n

B11 " " B1,m+l

#
#

[PB] =

#
#

"
"
B
B

m
+
l
,
1
m
+
l
,
m
+
l

G11 " " G1,m+ l

#
#
[QG] =
#
#

G
G

"
"
m
1
m,m+ l

G11
#
[ PGa ] =
#

Gm + l ,1
B11
#
[QBa ] =
#

Bm1

" "

B1,m +1 " " B1n

#
#
[QBb ] =
#
#

Bm ,m +1 " " Bmn

The iterative initial value of voltage amplitude and

phase angle can be calculated from (3) and (4), if used in
the Cartesian coordinate system, it needs to use the

following formula to converse, setting

This paper only gives the expression of approximate

linear solutions, while the deduced process can be seen in
[2], [3].

[ ] m + l

1
#

=
#

Vm + l

U i = Ei + jFi ,

then Ei = Vi cos i , Fi = Vi sin i .

1615

It can be calculated for Broyden method after getting

2nd IEEE International Conference on Power and Energy (PECon 08), December 1-3, 2008, Johor Baharu, Malaysia

the initial iteration value. Taking the approximate linear

solution as the initial value according to the above
formula, in general, it closer to the value that twice
iterations of Newton - Raphson method with the initial
value (E = 1.0, F = 0), so this initial value will make
higher convergence.
B. Broyden Algorithm
Secant method has the advantages of less calculation
work and higher efficiency, but it cannot be applied
because of its instability. Quasi-Newton method is the
development of the secant method, it has maintained
ultra-linear convergence belonging to the secant method,
and calculation work in each step is a lot less than
Newton-Raphson method, so it is widely used. The basic
idea of Broyden method is that: under a certain similar
sense, using a matrix which is non-singular and more
easily calculated than the Jacobian matrix to
approximately replace the Jacobian matrix, so the
iterative formula turns into x

k +1

= x k J 0k f ( x k ) , (k =

0, 1, ...). The article only introduces the Broyden Rank 1

method, and the deduction process can be seen in [4]-[8].
Below is the iterative formula of the final inverse
Broyden Rank 1method:

x k +1 = x k B k f ( x k )
k
k +1
k
s = x x
k
y = f ( x k +1 ) f ( x k )

1
B k +1 = B k +
( s k B k y k )( s k ) T B k
k T
k k

(s ) B y

(5)

During the process of iteration, it also needs to be

0

given an initial value ( x ) which is the same as with the

0

IV. ALGORITHM FOR SOFTWARE

Algorithm arrangements and calculation steps:
Step 1: Input original data, including the PQ buses and
balance bus;
Step 2: Calculate the initial value of Broyden method
with (3) and (4);
Step 3: Calculate the Jacobian matrix with initial
0

value x , or just substitutes B by the identity matrix

but not calculate the Jacobian matrix;
Step 4: Put the initial iteration value into Eq. (5), and
computing from the first equation to the fourth one.
Step 5: Make the calculated value as a new initial
iteration value, and judge the bus power imbalance value
is less than the given exiting circulation value or not,
if greater than , then return to the fourth step, otherwise
go to step 6;
Step 6: When the bus power imbalance value is less
than a given exiting circulation value (such as

= 10 5 ), exit the circulation and finish the calculation.

Where, k=0, 1,. B is a matrix has the same order

as the Jacobian matrix, Superscript k is the number of
iterations, k =0 is the initial value. Superscript T stands
for transpose, f ( x ) = 0 is the nonlinear equations for
solution.

Newton-Raphson method, and matrix

matrix each times, thus avoiding singular problems of the

Jacobian matrix, and has good numerical stability. As
long as the suitable initial value is given, it can be
convergent, using the approximate linear solution as
initial value. Generally, the higher the convergence order
of algorithm, the worse the stability of algorithm.
Newton-Raphson method is at least second order
convergence, and Broyden method is only ultra-linear
convergence, so in a sense it can be thought that the
stability of Broyden method is obtained by the lower
convergence order.

B 0 is the inverse

of the Jacobian matrix which has x as initial value or

the identity matrix I. It can be proved that the inverse
Broyden Rank 1 method is ultra-linear convergent under
certain conditions, the concrete evidence can be seen in
[4]-[7]. But the Broyden method has two main
drawbacks: Firstly, the convergence range is locally
convergent, which is the same as with the NewtonRaphson method; Secondly, it cannot self-correct. The
amount of iterations of the Broyden method is greater
compared to that of the Newton-Raphson method, but the
work involved in calculation in each step is much less
than the Newton-Raphson method, all in all, convergence
time is less than the Newton-Raphson method. As the
Broyden method does not need to calculate the Jacobian

V. CASE STUDY
The wiring diagram of grid as figure 1. Now take an
example for a 10 kV distribution network in China with
the above method, the system has 126 buses, of which
there are 125 PQ buses and a balance bus, it iterate 2
times when it meets the requirements, when stopping
calculation, the largest bus power imbalance value is
2.122210-8. But it needs 4 times iterations for NewtonRaphson method. The article calculate the system with
MATLAB procedures language, under the same
operation situation, the operation time is 0.8750 seconds
for Newton-Raphson method; but the time is 0.4060
seconds by using the method introduced in this article.
The system parameters are shown in Table I and Table
, No. 126 is balance bus, whose amplitude is 1.05 p.u. and
angle is zero. Table III gives the results of operations.
When the initial value are E=0.5 and F=0.0, NewtonRaphson method is divergence, but it can get the result by
the proposed algorithm.

1616

VI. CONCLUSION

2nd IEEE International Conference on Power and Energy (PECon 08), December 1-3, 2008, Johor Baharu, Malaysia

describes the Back/Forward sweep method usually used

in the distribution network, bringing forward an improved
method of Newtonian-Raphson method, which is
Broyden method. This power flow algorithm with the
core of Broyden Rank 1 method could improve the
operating speed of procedures and overcome the
numerical instability that often appears in the NewtonRaphson method in distribution network. Based on the
characteristics of its local convergence, this paper takes
the approximate linear solution as the initial iterative
value.

98
96

97

94
86 89

95
90

31 32 33 434445
126
1
4
6
2 3
5
35 36
21
46
22 34
39
23 24 37
38
25 26 40
41
27 28
42
29
30

68
8

7
47

48

49

50

51

52

53

54

55
62

69
10

9
70

125

73 72
74

63

65 66

92
88

77

56 57 58
59 60

91

93
85
111 112 124
80 81 82 83
18
12
14 15 16
17
11
19 20
13
109 110
99
71
79
100
114 115 116
78
102 103 113
101
76
120
119117 118
104 105
75
106 108
121
123
84

87

122

107

64 61

67

From an overall perspective, this approach has good

stability, which is a superior power flow algorithm in the
distribution network. It can well achieve the requirements
of power flow algorithm in the distribution network.

Figure 1. Wiring diagram of grid.

This paper firstly analyzes the advantages and

disadvantages of Newton-Raphson power flow algorithm,
for the different situations in the power transmission
network and distribution network, this paper makes a
detailed comparison to the Newton method and also

126
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
1
21
21
23
23
25
25
27
27
27
2
3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

0.00125
0.00031
0.00285
0.00143
0.00078
0.00063
0.0012
0.00089
0.00123
0.00087
0.00112
0.00093
0.00065
0.00086
0.0025
0.00342
0.00068
0.00083
0.0012
0.0014
0.0021
0.00086
0.00124
0.00056
0.0014
0.00071
0.00135
0.00065
0.00078
0.00053
0.0023
0.0021

0.0018
0.0005
0.00261
0.0013
0.00092
0.00074
0.00137
0.00105
0.00145
0.00103
0.00132
0.0011
0.00078
0.00102
0.00296
0.00405
0.0008
0.00098
0.00142
0.00166
0.00249
0.00078
0.00147
0.00051
0.00166
0.00065
0.0016
0.00059
0.00072
0.00048
0.0021
0.00249

32
4
4
35
35
37
37
37
40
40
5
5
5
6
7
47
47
49
49
51
51
53
53
55
56
57
56
57
58
55
62
63

33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

0.00304
0.0047
0.00153
0.00076
0.0012
0.00056
0.00086
0.00105
0.00075
0.00063
0.00124
0.00089
0.00034
0.00106
0.00096
0.00075
0.00103
0.00087
0.00097
0.00113
0.00078
0.00065
0.00121
0.00132
0.00069
0.00079
0.00023
0.00065
0.00057
0.0011
0.00096
0.00211

TABLE I.
BRANCHES PARAMETER
X
F
T
0.00278
0.0043
0.00181
0.0007
0.00142
0.00051
0.00079
0.00124
0.00068
0.00058
0.00114
0.00082
0.00031
0.00097
0.00113
0.00069
0.00122
0.0008
0.00115
0.00103
0.00092
0.0006
0.00143
0.00121
0.00063
0.00072
0.00021
0.00061
0.00052
0.0013
0.00088
0.00193

62
63
64
9
68
10
70
70
72
72
72
72
11
12
78
13
80
14
82
82
84
85
85
84
84
89
90
90
91
89
94
94

65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96

0.00087
0.00043
0.00056
0.00234
0.00035
0.00113
0.00056
0.00078
0.00065
0.00089
0.00056
0.00089
0.00135
0.00096
0.00068
0.0012
0.00056
0.00087
0.00142
0.00086
0.00076
0.00045
0.00069
0.00105
0.00088
0.00065
0.00105
0.00037
0.00057
0.00078
0.00093
0.00113

0.00103
0.00041
0.00052
0.00277
0.00034
0.00133
0.00052
0.00092
0.0006
0.00082
0.00052
0.00092
0.00124
0.00088
0.00062
0.0011
0.00052
0.00103
0.0013
0.00102
0.0007
0.00042
0.00063
0.00096
0.00105
0.0006
0.00096
0.00034
0.00052
0.00092
0.00086
0.00134

96
96
14
99
99
101
102
102
103
101
106
106
15
16
17
111
18
18
114
115
115
116
114
119
119
121
121
19
8

97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125

0.00067
0.00088
0.00134
0.00053
0.00086
0.00094
0.0013
0.00059
0.00088
0.00153
0.00069
0.00075
0.00109
0.0021
0.0013
0.00056
0.00148
0.00087
0.00171
0.00092
0.00121
0.00062
0.00135
0.0012
0.00221
0.00067
0.00083
0.00056
0.00462

0.00061
0.00081
0.00158
0.00049
0.00102
0.00086
0.00119
0.00054
0.00081
0.00181
0.00063
0.00069
0.001
0.00192
0.00119
0.00052
0.00136
0.00103
0.00157
0.00084
0.00111
0.00057
0.0016
0.0011
0.00262
0.00062
0.00076
0.00052
0.00423

Notes: F stands for from, T stands for To; R stands for resistance, X stands for reactance. The data of resistance and reactance are all p.u..
TABLE
BUSES PARAMETER
No.

No.

No.

No.

No.

1
2
3
4
5
6

0
0.12
0
0
0
0.35

0
0.085
0
0
0
0.19

26
27
28
29
30
31

0.078
0.042
0.056
0.023
0.063
0.105

0.045
0.025
0.042
0.012
0.047
0.068

51
52
53
54
55
56

0
0.009
0
0.034
0
0

0
0.006
0
0.026
0
0

76
77
78
79
80
81

0.049
0.035
0
0.034
0
0.056

0.042
0.026
0
0.024
0
0.044

101
102
103
104
105
106

0
0
0
0.035
0.055
0

0
0
0
0.025
0.042
0

1617

2nd IEEE International Conference on Power and Energy (PECon 08), December 1-3, 2008, Johor Baharu, Malaysia

7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

0
0
0.25
0
0
0.326
0
0
0
0.103
0
0
0.067
0.045
0
0.112
0
0.03
0

0
0
0.16
0
0
0.233
0
0
0
0.078
0
0
0.045
0.027
0
0.078
0
0.018
0

32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

0
0.204
0.135
0
0.012
0
0.045
0.03
0
0.085
0.026
0.033
0.052
0.036
0.024
0
0.036
0
0.045

0
0.176
0.098
0
0.008
0
0.031
0.018
0
0.053
0.015
0.021
0.034
0.025
0.016
0
0.022
0
0.034

57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75

0
0
0.053
0.035
0.024
0
0
0
0.078
0.023
0.013
0
0.035
0
0.024
0
0.045
0.032
0.025

0
0
0.038
0.02
0.015
0
0
0
0.054
0.015
0.008
0
0.021
0
0.017
0
0.032
0.02
0.017

82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100

0
0.034
0
0
0.022
0.034
0.042
0
0
0
0.044
0.036
0
0.065
0
0.023
0.071
0
0.025

0
0.021
0
0
0.015
0.021
0.031
0
0
0
0.035
0.022
0
0.047
0
0.015
0.052
0
0.017

107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125

0.078
0.032
0.043
0.013
0
0.047
0.076
0
0
0
0.039
0.056
0
0.043
0
0.035
0.068
0.042
0.035

0.059
0.021
0.024
0.008
0
0.03
0.056
0
0
0
0.024
0.037
0
0.031
0
0.024
0.049
0.029
0.023

Notes: P is active power of the load, Q is reactive power of the load. The data of active power and reactive power are all p.u..
TABLE III.
BUSES VOLTAGE
No.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

A
1.0394
1.0369
1.02
1.012
1.0076
1.0042
0.9986
0.99491
0.9899
0.98678
0.98315
0.9802
0.97856
0.9765
0.97334
0.96927
0.96861
0.96788
0.96754
0.96743
1.038
1.0378
1.0373
1.0373
1.0367
1.0366

Angle
-0.21426
-0.27424
-0.39965
-0.46142
-0.52919
-0.58159
-0.66039
-0.71551
-0.7909
-0.83725
-0.89147
-0.93636
-0.96222
-0.99444
-1.0456
-1.1106
-1.1213
-1.1331
-1.1391
-1.1414
-0.23791
-0.23899
-0.24828
-0.24856
-0.2587
-0.2597

No
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52

A
1.0363
1.0362
1.0363
1.0362
1.0365
1.0191
1.018
1.011
1.0115
1.0115
1.0111
1.0111
1.0111
1.0109
1.0108
1.0109
1.0076
1.0076
1.0076
1.0042
0.99799
0.99795
0.9974
0.99733
0.99693
0.99691

Angle
-0.26533
-0.26563
-0.26571
-0.26561
-0.27765
-0.40729
-0.40906
-0.46813
-0.47077
-0.4709
-0.4777
-0.47802
-0.47816
-0.48142
-0.48243
-0.48173
-0.52984
-0.52989
-0.52934
-0.58195
-0.66999
-0.67047
-0.67924
-0.67961
-0.68689
-0.68704

No.
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78

A
0.99656
0.99652
0.99607
0.99583
0.99577
0.99574
0.99581
0.99573
0.99572
0.99584
0.99579
0.99575
0.99572
0.99577
0.99573
0.98975
0.98973
0.98641
0.98639
0.98619
0.98614
0.98614
0.98616
0.9861
0.98307
0.98014

Angle
-0.69277
-0.69297
-0.70095
-0.70321
-0.70396
-0.70428
-0.70335
-0.70445
-0.7045
-0.70462
-0.70517
-0.70565
-0.70654
-0.70534
-0.70578
-0.79369
-0.79396
-0.84244
-0.84261
-0.84552
-0.84588
-0.84602
-0.84572
-0.84597
-0.89197
-0.93677

No.
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104

A
0.9801
0.97844
0.97839
0.9759
0.97582
0.97535
0.97528
0.97527
0.97525
0.97528
0.97495
0.97486
0.9748
0.97484
0.97477
0.97472
0.97461
0.97452
0.97449
0.97441
0.97593
0.97591
0.9756
0.97545
0.97533
0.97542

Angle
-0.93705
-0.96274
-0.96301
-1.0039
-1.0047
-1.0122
-1.013
-1.0131
-1.0134
-1.0127
-1.0183
-1.019
-1.0196
-1.0191
-1.02
-1.0217
-1.0225
-1.0248
-1.025
-1.0255
-1.0026
-1.0028
-1.0073
-1.0081
-1.0088
-1.0084

No.
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126

A
0.97524
0.97528
0.97518
0.97524
0.97327
0.96922
0.96851
0.96847
0.96769
0.96749
0.96722
0.96714
0.96714
0.96708
0.96711
0.96702
0.96668
0.96664
0.96658
0.9675
0.99465
1.05

Angle
-1.0092
-1.0119
-1.0124
-1.0123
-1.0466
-1.1111
-1.1223
-1.1228
-1.1344
-1.1396
-1.1423
-1.1431
-1.1432
-1.1436
-1.1453
-1.1459
-1.1519
-1.1523
-1.1526
-1.1395
-0.71793
0

Notes: A stands for amplitude. The data of the amplitude are all p.u., angle value is degree measure.
[4]

REFERENCES
[1]

[2]

[3]

XSZhang, Zh. Liu, E. K. Yu, J. Ch. Chen, A comparison on

power flow calculation methods for distribution network, Power
System Technology, vol. 22, No. 4, pp. 45-49, Apr. 1998. (in
Chinese)
G. Leonidopoulos. Fast Linear Method and convergence
Improvement of Load Flow Solution Methods, Electric Power
System Research. Vol. 16, 1989.
J. Sh. Wu. Calculation Method for Steady-state Analysis of Power
System, 1st ed.. Shanghai: Shanghai Jiao Tong University Press,
1992, pp.1-8. (in Chinese)

[5]

[6]

[7]
[8]

1618

J. M. Ortega and W. C. Rheinboldt. Iterative Solution of Nonlinear

Equations in Several Variables, 1st ed.. Beijing: Academic Press,
1983, p.225. (in Chinese)
G. Ch. Feng. Iterative Solution of Nonlinear Equations, 1st ed..
Shanghai: Shanghai scientific & Technical Publishers, 1989,
pp.182-196. (in Chinese)
R. B. Xie, P. Q. jiang. Nonlinear Numerical Analysis, 1st ed..
Shanghai: Shanghai Jiao Tong University Press, 1984, pp.46-55.
(in Chinese)
Q. Y. Li, Z. Zh. Mo. Numerical Solutions of Nonlinear Equations,
1st ed.. Beijing: Academic Press, 1987, pp.101-118. (in Chinese)
X. Y. Zheng. Computational Methods, 1st ed.. Guangzhou: South
China University of Technology press, 2002, pp.103-106. (in
Chinese)