
You have already added 0 works in your ORCID record related to the merged Research product.
You have already added 0 works in your ORCID record related to the merged Research product.
<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://beta.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>
Convergence improving minimization technique for a modified fast decoupled load flow

handle: 11311/517116
AbstractThis paper describes an efficient and reliable algorithm that modifies the Fast Decoupled Load Flow (FDLF) in order to overcome non‐convergence troubles in solving strongly stressed power systems. The Hartkopf's algorithm for improving the Newton‐Raphson method's convergence features in ill‐conditioned cases is taken as a basis. The proposed changes to FDLF consist fundamentally in minimizing the squared power mismatches with a second order interpolation technique. The simple modification makes it possible to establish for sure whether a case of non‐convergence is owing to numerical or to physical problems, and lets the operator evaluate the system condition correctly. Several numerical examples show the remarkable behaviour of the algorithm proposed.
- Polytechnic University of Milan Italy
- University of Pavia Italy
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
