Study of fast decoupled load flow algorithms with substantially reduced memory requirements

Abstract The convergence pattern of fast decoupled load flow (FDLF) algorithms with substantially reduced memory requirements is presented in this paper. The convergence performance of FDLF algorithms as compared with the Newton-Raphson algorithm under various loading conditions is demonstrated. Furthermore, one particular formulation of an FDLF algorithm which allows substantial reduction in memory requirements with approximately the same convergence rate as the current FDLF method is described. The proposed method is simple and can easily be added to the existing FDLF programs.