An improved relaxation based spatial domain decomposition method for parallel transient stability simulation

被引:6
作者
Gnanavignesh, R. [1 ]
Shenoy, U. Jayachandra [1 ]
机构
[1] Indian Inst Sci, Dept Elect Engn, Bangalore, Karnataka, India
关键词
Transient stability simulation; Parallel computing; Power grid; Domain decomposition; DYNAMIC SIMULATION; POWER-SYSTEMS; IMPLEMENTATION; ALGORITHM;
D O I
10.1016/j.ijepes.2021.107561
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Transient stability assessment by time domain simulation is an indispensable module in Dynamic Security Assessment application employed for maintaining power system security and reliability. Due to continuous expansion and imposition of new complexities, reduction in time required for the simulation of system dynamics is vital for both grid operation and planning. This paper proposes a domain decomposition methodology employing spatial parallelism based on relaxation conditions to speedup transient stability simulations to handle the aforementioned challenge. Since convergence is an issue in relaxation methods, in this work, a convergence enhancing mechanism involving admittance parameters of fictitious networks which mimic the rest of the system for each decomposed smaller network is derived. The proposed method, improves the convergence property of the Parallel Update Relaxation algorithm employed for the concurrent simulation. Also, a technique of port dependency reduction, which guarantees convergence for any general network is presented. The accuracy of the proposed algorithm is validated on a 9-bus system. For the purpose of measuring the performance metrics of the algorithm, two large test cases comprising of 39936 and 79872 buses are considered. Results corroborate the scalability and improved speedup features of the methodology which achieves a significant reduction in the simulation execution time.
引用
收藏
页数:14
相关论文
共 36 条
[1]   Real-Time Power System Dynamics Simulation Using a Parallel Block-Jacobi Preconditioned Newton-GMRES Scheme [J].
Abhyankar, Shrirang ;
Flueck, Alexander J. .
2012 SC COMPANION: HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS (SCC), 2012, :299-305
[2]   SPARSITY IN DIAKOPTIC ALGORITHMS [J].
ALVARADO, FL ;
REITAN, DK ;
BAHARIKASHANI, M .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1977, 96 (05) :1450-1459
[3]   PARALLEL SOLUTION OF TRANSIENT PROBLEMS BY TRAPEZOIDAL INTEGRATION [J].
ALVARADO, FL .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1979, 98 (03) :1080-1090
[4]  
[Anonymous], 2017, Power system dynamics and stability with synchrophasor measurement and power system toolbox
[5]  
[Anonymous], 2003, Iterative Methods for Sparse Linear Systems, DOI DOI 10.1137/1.9780898718003
[6]   Power System Dynamic Simulations Using a Parallel Two-Level Schur-Complement Decomposition [J].
Aristidou, Petros ;
Lebeau, Simon ;
Van Cutsem, Thierry .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2016, 31 (05) :3984-3995
[7]   Dynamic Simulation of Large-Scale Power Systems Using a Parallel Schur-Complement-Based Decomposition Method [J].
Aristidou, Petros ;
Fabozzi, Davide ;
Van Cutsem, Thierry .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (10) :2561-2570
[8]   An updated set of Basic Linear Algebra Subprograms (BLAS) [J].
Blackford, LS ;
Demmel, J ;
Dongarra, J ;
Duff, I ;
Hammarling, S ;
Henry, G ;
Heroux, M ;
Kaufman, L ;
Lumsdaine, A ;
Petitet, A ;
Pozo, R ;
Remington, K ;
Whaley, RC .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2002, 28 (02) :135-151
[9]  
Chiang H., 2010, DIRECT METHODS STABI, P6, DOI [10.1002/9780470872130, DOI 10.1002/9780470872130]
[10]  
Clarke L., 1994, PROGRAMMING ENV MASS, P213, DOI [10.1007/978-3-0348-8534-8_21, DOI 10.1007/978-3-0348-8534-8_21]