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.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
