Combining direct and inverse factors for solving sparse network equations in parallel

Journal Article · Tue Nov 01 04:00:00 EST 1994 · IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States)

DOI:https://doi.org/10.1109/59.331454· OSTI ID:6597710

Morelato, A ^[1]; Amano, M ^[2]; Kokai, Y

---

1. Univ. of Campinas (Brazil)
2. Hitachi, Ltd., Ibaraki (Japan). Hitachi Research Lab.

A new parallel algorithm for solving the forward and back substitution part of the solution of sparse network equations is proposed. The approach assumes that the network equations are solved by LDU factorization and sparse vector techniques. The parallelization approach is based on the factorization path tree and its main feature is the switching from direct factor to inverse factors to best exploit the parallelism during the solution. The algorithm can be easily mapped on a multiprocessor architecture that exhibits both global and local memories. An illustrative example and validation results showing the effectiveness of the algorithm are also presented.

• OSTI ID: 6597710
• Journal Information: IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States), Journal Name: IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States) Vol. 9:4; ISSN ITPSEG; ISSN 0885-8950
• Country of Publication: United States
• Language: English

Related Subjects

24 POWER TRANSMISSION AND DISTRIBUTION
240100* -- Power Systems-- (1990-)
CALCULATION METHODS
COMPUTER CALCULATIONS
ELECTRICAL TRANSIENTS
ENERGY SYSTEMS
MESH GENERATION
POWER SYSTEMS
STABILITY
TRANSIENTS
VOLTAGE DROP