The texture of the power system which governs; the interplay of reactive power and voltage is emulated by a textured model which assembles local groups of buses into a multi-leaf structure. Groups on the same leaf of the model are not coupled with each other; groups on different leaves overlap partially and are thus coupled. The paths of computational information are organized in an efficient manner and inefficient computation and information paths are eliminated; however, the computation converges to the exact solution, not an approximate one. The resulting model is ideally suited for parallel processing, especially since there is no sequential component in the computation, no computation overhead, and (if the size of the groups and their numbers per leaf are uniform) no waiting time. A 100-fold saving in computation time has been observed in experiments on steepest descent algorithms with systems of around 100 buses. Computation times also compare favorably with existing speedup techniques such as block pivoting. Computation times for common algorithms (like matrix manipulations, Newton-Raphson, linear and nonlinear programming) increase with the system size at a fast nonlinear rate. The computation times remain essentially constant for the textured model in parallel processing. Thus, very large computation time savings are implied on larger systems.
|Number of pages||10|
|Journal||IEEE Transactions on Power Apparatus and Systems|
|Publication status||Published - 1 Jul 1985|
ASJC Scopus subject areas