Premium
Elimination of floating nodes for load flow calculation
Author(s) -
Matoba Seiichi,
Yokoyama Ryuichi
Publication year - 1999
Publication title -
electrical engineering in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.136
H-Index - 28
eISSN - 1520-6416
pISSN - 0424-7760
DOI - 10.1002/(sici)1520-6416(19991115)129:2<22::aid-eej3>3.0.co;2-u
Subject(s) - jacobian matrix and determinant , computation , convergence (economics) , newton's method , matrix (chemical analysis) , node (physics) , reduction (mathematics) , algorithm , electric power system , mathematics , power (physics) , computer science , flow (mathematics) , mathematical optimization , control theory (sociology) , topology (electrical circuits) , engineering , geometry , nonlinear system , materials science , structural engineering , control (management) , quantum mechanics , artificial intelligence , combinatorics , economics , composite material , economic growth , physics
Most approaches aiming at reduction of the power flow computation time approximate the Jacobian matrix. Thus, the convergence is degraded compared to the conventional Newton method. This paper proposes a new approach for reducing the processing time by considering the fact that half of the nodes in real power systems are floating nodes that can be removed. In the conventional reduced matrix approach where the floating nodes are removed, the sparsity is lost. The method in this paper does not remove all of the floating nodes but keeps some nodes by using an optimal criterion for keeping the sparsity. The criterion is to indicate the minimum number of elements in the reduced matrix. This method has been applied to a 1000‐node test system. It was verified that the number of elements of the Jacobian has been reduced to about one‐half that of the conventional matrix. And computation time has been remarkably improved without sacrificing the convergence characteristics for the power flow computation. © 1999 Scripta Technica, Electr Eng Jpn, 129(2): 22–30, 1999