Power-flow study: Difference between revisions

Revision as of 02:18, 8 September 2012

Revision as of 11:35, 1 October 2012

Line 59:

==Power flow methods==

*[[Gauss–Seidel method]]: This is the earliest devised method. It shows slower rates of convergence compared to other iterative methods, but it uses very little memory and does not need to solve a matrix system.

*[[Newton–Raphson method]] This is the standard of art. It becomes less accurate as voltages fail.

*[[Newton–Raphson method]]: Most current methods are based on this. The convergence rate is typically fast, but it may sometimes fail because of the inherent problems of fractality in the basins of attraction of the underlying iterative map.

*[[Fast-decoupled-load-flow method]] Used for fast approximations.

*[[Fast-decoupled-load-flow method]]: A variation on Newton-Raphson that exploits the approximate decoupling of active and reactive flows in well-behaved power networks, and additionaly fixes the value of the Jacobian during the iteration in order to avoid costly matrix decompositions. Also referred to as "fixed-slope, decoupled NR".

*[[Gauss Iterative method]]

*[[Holomorphic embedding load flow method]]: A recently developed method based on advanced techniques of complex analysis. It is direct and guarantees the calculation of the correct (operative) branch, out of the multiple solutions present in the power flow equations.

*[[Gauss–Seidel method]]

*[[Holomorphic embedded load flow method]] A newer method that retains accuracy as voltage fails.

==References==