Multicore Simulation of Power System Transients

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Multicore Simulation of Power System Transients introduces a notional power system model consisting of hundreds of power apparatus and is used to demonstrate how to partition and parallelise the simulation of power system transients on a multicore desktop PC. The power system throughout Multicore Simulation of Power System Transients is discretised and formulated using the mesh and nodal methods. The author shows that the mesh method can result in matrices that are 99% sparse and that graph theory is not required. Several examples are included in this new book to conceptually show how power systems are partitioned and parallelised. To provide a reference on how fast a multicore solver can be, parallel simulation runtimes are compared against MATLAB/Simulink. Topics covered include: power system modelling in the time domain, discretisation, network formulation, network partitioning, multithreading and performance analysis.

Author(s): Fabian Uriarte
Series: IET Power and Energy Series 67
Publisher: The Institution of Engineering and Technology
Year: 2013

Language: English
Pages: xxvi+286
Tags: Библиотека;Компьютерная литература;Matlab / Simulink;

Multicore Simulation
of Power System
Transients......Page 4
Contents......Page 8
List of tables......Page 11
List of figures......Page 12
List of snippets......Page 19
About the author......Page 20
Foreword......Page 22
Preface......Page 24
Acknowledgments......Page 26
1.1 Scope and purpose......Page 28
1.3 Contributions......Page 30
1.5 Organization......Page 31
2 The power system model......Page 34
2.1 Power system model......Page 35
2.2 System size......Page 40
2.3 System variants......Page 41
2.4 Summary......Page 51
3.1 The time grid......Page 52
3.2 Time interpolation......Page 56
3.4 Timestep selection......Page 59
3.5 Summary......Page 61
4.1 Discretization......Page 62
4.1.1 Tunable integration......Page 63
4.1.2 Root-matching......Page 64
4.2.1 Stand-alone branches......Page 65
4.2.1.1 Resistor......Page 66
4.2.1.2 Inductor......Page 68
4.2.1.3 Capacitor......Page 69
4.2.1.4 Voltage source......Page 70
4.2.1.5 Current source......Page 71
4.2.2.1 Series RL......Page 72
4.2.2.2 Series RC......Page 74
4.2.3.1 Switch types......Page 80
4.2.3.2 Switch branch models......Page 82
4.2.3.3 Interpolation......Page 84
4.3.1 State-variable equations......Page 87
4.3.2 First-order transfer functions......Page 89
4.3.3 Moving RMS......Page 90
4.3.5 Power flow......Page 94
4.3.6 PID controller......Page 96
4.3.7 PWM generator......Page 97
4.4 Summary......Page 99
5.1 Cables......Page 102
5.2 Static loads......Page 105
5.3 Protective devices......Page 109
5.3.1 Circuit breakers......Page 110
5.3.2 Low-voltage protection......Page 112
5.3.3 Bus transfers......Page 114
5.4.1 Rectifier......Page 116
5.4.2 DC filter......Page 123
5.4.3 Inverter......Page 125
5.4.4 Motor......Page 131
5.4.5 Rotor......Page 132
5.5 Transformers......Page 137
5.6 Generation......Page 143
5.7 Summary......Page 146
6.1 Multi-terminal components......Page 148
6.3 Forming the mesh matrix......Page 150
6.3.2 Connection tensor......Page 152
6.3.3 Algorithm to form tensor......Page 155
6.4 Forming the nodal matrix......Page 163
6.5 Summary......Page 167
7 Partitioning......Page 170
7.1 Diakoptics......Page 171
7.3 Zero-immittance tearing......Page 174
7.4 Mesh tearing......Page 177
7.5 Node tearing......Page 184
7.6 Tearing examples......Page 189
7.6.1 Node tearing......Page 192
7.6.1.1 Two partitions......Page 195
7.6.1.2 Three partitions......Page 198
7.6.1.3 Four partitions......Page 203
7.6.1.4 Observations......Page 206
7.6.2.1 Two partitions......Page 210
7.6.2.2 Three partitions......Page 211
7.6.2.3 Four partitions......Page 215
7.6.2.4 Observations......Page 216
7.7 Validation......Page 218
7.8 Graph partitioning......Page 222
7.9 Overall difference between mesh and node tearing......Page 226
7.10 Summary......Page 227
8.1 Solution procedure......Page 230
8.2 Parallel implementation in C#......Page 234
8.2.2 Program example......Page 235
8.3 Summary......Page 241
9 Performance analysis......Page 242
9.1 Performance metrics......Page 244
9.2.1 System 1......Page 247
9.2.2 System 2......Page 251
9.2.3 System 3......Page 255
9.2.4 System 4......Page 259
9.3 Summary of results......Page 264
9.4 Summary......Page 268
10 Overall summary and conclusions......Page 270
Appendix A: Compatible frequencies with Δt......Page 278
B.1 Mesh vs. loop analysis......Page 284
B.2.1 Appearance of graph hyper-branches......Page 285
B.2.3 Can model open circuits?......Page 286
B.2.6 Equation count......Page 287
B.2.9 Kirchhoff law......Page 288
B.2.12 Sparsity......Page 289
References......Page 290
Index......Page 306