Abstract

In recent studies, the competitiveness of the Newton-S-Iteration-Process (Newton-SIP) techniques to efficiently solve the Power Flow (PF) problems in both well and ill-conditioned systems has been highlighted, concluding that these methods may be suitable for industrial applications. This paper aims to tackle some of the open topics brought for this kind of techniques. Different PF techniques are proposed based on the most recently developed Newton-SIP methods. In addition, convergence analysis and a comparative study of four different Newton-SIP methods PF techniques are presented. To check the features of considered PF techniques, several numerical experiments are carried out. Results show that the considered Newton-SIP techniques can achieve up to an eighth order of convergence and typically are more efficient and robust than the Newton–Raphson (NR) technique. Finally, it is shown that the overall performance of the considered PF techniques is strongly influenced by the values of parameters involved in the iterative procedure.

Highlights

  • Power Flow (PF) is the backbone of power system analysis

  • We have considered the standard form of Newton-S-iteration process (SIP) techniques, i.e., those algorithms in which the Jacobian matrix is only updated at the first iteration

  • A fully updated iterative scheme has been considered, in which the Jacobian matrix is updated each iteration as NR

Read more

Summary

Introduction

From a mathematical point of view, PF is a nonlinear problem in which the operational steady state of a power system is obtained. Traditional methods for tackling this problem are the iterative NR [1] and decoupled techniques [2,3,4]. PF is customarily solved in polar coordinates form, other formulations have been studied. A PF formulation based on current injections instead of power injections has been proposed by da Costa et al [5] and posteriorly embellished by Garcia et al in [6]. Saleh has developed a formulation of the PF problem in the well-known d-q framework in [7,8]. PF formulation in complex variables has been exploited in [9], using Witinger Calculus

Objectives
Methods
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.