Abstract
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2018 IEEE PES General Meeting |
| Publisher | IEEE |
| Publication date | 2018 |
| ISBN (Print) | 9781538677032 |
| DOIs | |
| Publication status | Published - 2018 |
| Event | 2018 IEEE PES General Meeting - Oregon Convention Center, Portland, United States Duration: 5 Aug 2018 → 9 Aug 2018 |
Conference
| Conference | 2018 IEEE PES General Meeting |
|---|---|
| Location | Oregon Convention Center |
| Country | United States |
| City | Portland |
| Period | 05/08/2018 → 09/08/2018 |
Cite this
}
Super-Positioning of Voltage Sources for Fast Assessment of Wide-Area Thévenin Equivalents. / Møller, Jakob Glarbo; Jóhannsson, Hjörtur; Østergaard, Jacob.
Proceedings of the 2018 IEEE PES General Meeting. IEEE, 2018.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
TY - GEN
T1 - Super-Positioning of Voltage Sources for Fast Assessment of Wide-Area Thévenin Equivalents
AU - Møller, Jakob Glarbo
AU - Jóhannsson, Hjörtur
AU - Østergaard, Jacob
PY - 2018
Y1 - 2018
N2 - A method for superimposing voltage sources is sought optimized by using a sparse triangular solver and multiprocessing. A revision to the method is suggested which exploits Schur’s complement of the network admittance matrix and optimal re-use of computations. The algorithm is implemented and parallelized for shared memory multiprocessing. The proposed algorithm is tested on a collection of large test systems and performance is found to be significantly better than the reference method. The algorithm will thereby facilitate a speed-up of methods relying on Thévenin equivalent representation such as the Thévenin equivalent method for contingency assessment.
AB - A method for superimposing voltage sources is sought optimized by using a sparse triangular solver and multiprocessing. A revision to the method is suggested which exploits Schur’s complement of the network admittance matrix and optimal re-use of computations. The algorithm is implemented and parallelized for shared memory multiprocessing. The proposed algorithm is tested on a collection of large test systems and performance is found to be significantly better than the reference method. The algorithm will thereby facilitate a speed-up of methods relying on Thévenin equivalent representation such as the Thévenin equivalent method for contingency assessment.
U2 - 10.1109/PESGM.2018.8585962
DO - 10.1109/PESGM.2018.8585962
M3 - Article in proceedings
SN - 9781538677032
BT - Proceedings of the 2018 IEEE PES General Meeting
PB - IEEE
ER -