Newton Raphson Method
Newton Raphson Method
Newton Raphson Method
By
DR AZIAH KHAMIS
Each iteration is relatively fast (computational
order is proportional to number of branches +
number of buses in the system).
Relatively easy to program.
2
Tends to converge relatively slowly, although this can
be improved with acceleration.
Has tendency to fail to find solutions, particularly on
large systems.
Tends to diverge on cases with negative branch
reactances (common with compensated lines).
Need to program using complex numbers.
Gauss and Gauss-Seidel mostly replaced by Newton-
Raphson.
3
NEWTON RAPHSON POWER FLOW SOLUTION
Advantages
less number of iteration to reach
convergence, takes less computation time
More accurate and not sensitive to the
factors likes slack bus selection, regulation
transformer, the number of iteration
required is almost independent of system
size
NEWTON RAPHSON POWER FLOW SOLUTION
Disadvantages
more calculations involved in each
iteration and require large computation
time per iteration and large computer
memory
Difficult solution technique
(programming is difficult)
POWER FLOW EQUATIONS
KCL for current injection
Obtaining the solution of the above matrix equation, the new bus voltages in the
first iteration are
SOLUTION
Voltage phase angle are in radian. For second iteration:
AND
SOLUTION
For third iteration:
AND
SOLUTION
The power converge in 3 iterations with a maximum power mismatch of 2.5 x 10-4
with V2 =0.97168 ∟-2.696◦ and V3 = 1.04 ∟-0.4988◦
Thus;