Improving the Convergence Rate of Parareal-in-time Power System Simulation using the Krylov Subspace

Nan Duan, Srdjan Simunovic, Aleksandar Dimitrovski, Kai Sun

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

The performance of parareal-in-time algorithms is determined on the number of sequential, coarse step iterations. A common tradeoff in designing an efficient parareal-in-time algorithm is between accuracy of the coarse solver and the number of iterations. Traditional parareal implementation for the power system simulation can also have difficulties handling complex power systems. In this paper, we propose a Krylov subspace enhanced parareal algorithm to reduce the number of coarse iterations. The proposed approach is demonstrated on a single-machine-infinite-bus system and the IEEE 10-machine 39-bus system. Noticeable decrease of number of iterations is observed in both cases.

Original languageEnglish
Title of host publication2018 IEEE Power and Energy Society General Meeting, PESGM 2018
PublisherIEEE Computer Society
ISBN (Electronic)9781538677032
DOIs
StatePublished - Dec 21 2018
Event2018 IEEE Power and Energy Society General Meeting, PESGM 2018 - Portland, United States
Duration: Aug 5 2018Aug 10 2018

Publication series

NameIEEE Power and Energy Society General Meeting
Volume2018-August
ISSN (Print)1944-9925
ISSN (Electronic)1944-9933

Conference

Conference2018 IEEE Power and Energy Society General Meeting, PESGM 2018
Country/TerritoryUnited States
CityPortland
Period08/5/1808/10/18

Keywords

  • High-performance-computing
  • Krylov subspace
  • Numerical method
  • Parareal-in-time
  • Power system simulation

Fingerprint

Dive into the research topics of 'Improving the Convergence Rate of Parareal-in-time Power System Simulation using the Krylov Subspace'. Together they form a unique fingerprint.

Cite this