Faster-than-real-time power system transient stability simulation using Parallel General Norton with Multiport Equivalent (PGNME)

Sullivan, Brian; Shi, Jian; Mazzola, Mike; Saravi, Babak

doi:10.1109/pesgm.2017.8274433

Cited by 10 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By developing, testing and validating the performance of the proposed algorithm on a 110-node, 2200-modern HPC cluster, it is demonstrated for the first time that massive power system dynamic simulation is feasible. In [30], it is also demonstrated that faster-than-real-time performance can be obtained using the proposed algorithm with the smallest time step on the largest system model as compared to existing literature using similar modeling strategies.…”

Section: Introductionmentioning

confidence: 85%

See 2 more Smart Citations

A Relaxation-Based Network Decomposition Algorithm for Parallel Transient Stability Simulation with Improved Convergence

Shi

Sullivan

Mazzola

et al. 2018

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

Transient stability simulation of a large-scale and interconnected electric power system involves solving a large set of differential algebraic equations (DAEs) at every simulation time-step. With the ever-growing size and complexity of power grids, dynamic simulation becomes more time-consuming and computationally difficult using conventional sequential simulation techniques. To cope with this challenge, this paper aims to develop a fully distributed approach intended for implementation on High Performance Computer (HPC) clusters. A novel, relaxation-based domain decomposition algorithm known as Parallel-General-Norton with Multiple-port Equivalent (PGNME) is proposed as the core technique of a two-stage decomposition approach to divide the overall dynamic simulation problem into a set of subproblems that can be solved concurrently to exploit parallelism and scalability. While the convergence property has traditionally been a concern for relaxation-based decomposition, an estimation mechanism based on multiple-port network equivalent is adopted as the preconditioner to enhance the convergence of the proposed algorithm. The proposed algorithm is illustrated using rigorous mathematics and validated both in terms of speed-up and capability. Moreover, a complexity analysis is performed to support the observation that PGNME scales well when the size of the subproblems are sufficiently large.

show abstract

Section: Introductionmentioning

confidence: 85%

“…(2-b). However, in [30], the complete simulation routine shown in Fig. 1(a) was tested and very satisfactory results were obtained.…”

Section: A Two-stage Decomposition Structurementioning

confidence: 99%

See 1 more Smart Citation

A Relaxation-Based Network Decomposition Algorithm for Parallel Transient Stability Simulation with Improved Convergence

Shi

Sullivan

Mazzola

et al. 2018

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…So another notable problem in the hard realtime simulation is how to handle these operations. In the widely used commercial transient simulation tool the OPAL-RT real-time simulator, the coefficient matrix for all events has to be precalculated and stored before the simulation, so as to reduce the computation burden during the real-time simulation [18]. This is a compromise between its real-time performance and flexibility.…”

Section: Introductionmentioning

confidence: 99%

Efficiency enhancement method without grid partitioning for hard real‐time transient simulation of large power grids

Zhang

Zhu

et al. 2018

IET Generation, Transmission & Distribution

View full text Add to dashboard Cite

“…Parallel calculation is another hot topic in power system simulation. [43] shows was proposed in [45]. PGNME partitions the large linear power system into several small one and builds Norton equivalent circuit for each port.…”

Section: Numerical Examplementioning

confidence: 99%

Parallel Domain Decomposition Based Power System Simulation

Zhao¹

View full text Add to dashboard Cite

With the continuous developing of power systems, simulation of modern systems requires more computational resources and more simulation time. Conventional techniques are not efficient due to the large size of equation set and inconvenient modelling methods. Although computing power has increased dramatically, we still need new algorithms to improve the simulation speed. To address the above problems, this thesis proposes an efficient parallel calculation algorithm based on domain decomposition method. The new approach reduces the computational cost by calculating in parallel and splitting the equation set. The proposed approach partitions the system into several subsystems to be solved in parallel on different processors and at the same time preserves the details of the original system. To reduce the cost of communication overhead and computation load, latency characteristic is utilized. Not all the Jacobian matrix is updated in every iteration. Traditional simulators (transient stability and electromagnetic transient) as well as the hybrid simulator are described and compared with this algorithm. Computational examples are used to validate the accuracy of new proposed algorithm and its efficiency.

show abstract

Faster-than-real-time power system transient stability simulation using Parallel General Norton with Multiport Equivalent (PGNME)

Cited by 10 publications

References 18 publications

A Relaxation-Based Network Decomposition Algorithm for Parallel Transient Stability Simulation with Improved Convergence

A Relaxation-Based Network Decomposition Algorithm for Parallel Transient Stability Simulation with Improved Convergence

Efficiency enhancement method without grid partitioning for hard real‐time transient simulation of large power grids

Parallel Domain Decomposition Based Power System Simulation

Contact Info

Product

Resources

About