### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 1718-1727 |

Number of pages | 10 |

Journal | IEEE Transactions on Power Apparatus and Systems |

Volume | PAS-104 |

Issue number | 7 |

Publication status | Published - 1 Jul 1985 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*IEEE Transactions on Power Apparatus and Systems*,

*PAS-104*(7), 1718-1727.

**TEXTURED MODEL FOR COMPUTATIONALLY EFFICIENT REACTIVE POWER CONTROL AND MANAGEMENT.** / Zaborszky, J.; Huang, Garng Morton; Lu, K. W.

Research output: Contribution to journal › Article

*IEEE Transactions on Power Apparatus and Systems*, vol. PAS-104, no. 7, pp. 1718-1727.

}

TY - JOUR

T1 - TEXTURED MODEL FOR COMPUTATIONALLY EFFICIENT REACTIVE POWER CONTROL AND MANAGEMENT.

AU - Zaborszky, J.

AU - Huang, Garng Morton

AU - Lu, K. W.

PY - 1985/7/1

Y1 - 1985/7/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022090708&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022090708&partnerID=8YFLogxK

M3 - Article

VL - PAS-104

SP - 1718

EP - 1727

JO - IEEE Transactions on Power Apparatus and Systems

JF - IEEE Transactions on Power Apparatus and Systems

SN - 0018-9510

IS - 7

ER -