Parallel algorithm based on symplectic Radau method for transient stability simulation

The research about parallel-in-time algorithms for transient stability parallel computation focuses on the solving effectively the contradiction between parallelism-in-time and convergence, which is the main problem existed for the research topic. In this paper, the s-stage and 2s-1 order symplectic...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Dianli Xitong Baohu yu Kongzhi 2011-12, Vol.39 (23), p.34-38
Hauptverfasser: Wang, Fang-Zong, Zhang, Lei
Format: Artikel
Sprache:chi
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The research about parallel-in-time algorithms for transient stability parallel computation focuses on the solving effectively the contradiction between parallelism-in-time and convergence, which is the main problem existed for the research topic. In this paper, the s-stage and 2s-1 order symplectic Radau method is adopted for transient stability simulation. Based on the special matrix structure of the symplectic Radau method, a simple matrix transformation technique, which is similar to the so-called Jordan decomposition, is used for the decoupling of the computational task associated with the different time-points, and thus yields a new parallel-in-time algorithm where the computational task involved in different time-points can be solved independently or parallelly. The mathematical derivations and tests in IEEE 118-bus and IEEE 145-bus power system show that, the proposed algorithm is fully parallel-in-time, and at the same time keeps the convergence characteristics of Newton method, thus presents an effi
ISSN:1674-3415