A comparison of power flow by different ordering schemes

Node ordering algorithms, aiming at keeping sparsity as far as possible, are widely used today. In such algorithms, their influence on the accuracy of the solution is neglected because it won´t make significant difference in normal systems. While, along with the development of modern power systems, the problem will become more ill-conditioned and it is necessary to take the accuracy into count during node ordering. In this paper we intend to lay groundwork for the more rationality ordering algorithm which could make reasonable compromising between memory and accuracy. Three schemes of node ordering for different purpose are proposed to compare the performance of the power flow calculation and an example of simple six-node network is discussed detailed.