2009
DOI: 10.1016/j.ijepes.2009.02.002
|View full text |Cite
|
Sign up to set email alerts
|

Parallel solution of large power system networks using the Multi-Area Thévenin Equivalents (MATE) algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0
1

Year Published

2012
2012
2022
2022

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 51 publications
(28 citation statements)
references
References 5 publications
0
26
0
1
Order By: Relevance
“…In this case, applying (34)-(39) into (31) and (32) Moreover, further neglecting the sequential and communication factors yields the theoretical speedup of the MATE algorithm of p 1+c /2 time over sparsity-oriented solvers. As also shown by Alvarado [41] and verified by Tomim [28], the parameter c tends to zero in modern computer architectures, the theoretical MATE speedup can be estimated in p/2, where p is the number of subsystems. As for the theoretical efficiency of the method, for a large enough number of subsystems, an efficiency of about 50% should be expected.…”
Section: Performance Analysismentioning
confidence: 53%
See 2 more Smart Citations
“…In this case, applying (34)-(39) into (31) and (32) Moreover, further neglecting the sequential and communication factors yields the theoretical speedup of the MATE algorithm of p 1+c /2 time over sparsity-oriented solvers. As also shown by Alvarado [41] and verified by Tomim [28], the parameter c tends to zero in modern computer architectures, the theoretical MATE speedup can be estimated in p/2, where p is the number of subsystems. As for the theoretical efficiency of the method, for a large enough number of subsystems, an efficiency of about 50% should be expected.…”
Section: Performance Analysismentioning
confidence: 53%
“…The parameter b max , in (27), represents the maximum number of border nodes in the subsystems. Table 1 Partitioning of the WECC system according to multi-level recursive bisection algorithm.…”
Section: Performance Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…Using several different test cases, the authors' earlier work [9], showed that GPU-based EMT simulation produces exactly the same result as the commercial tools. Other researchers also used this approach for creating large test cases [5], [12], [13], [30].…”
Section: Test Cases Used For Gpu Based Emt Simulationmentioning
confidence: 99%
“…Many attempts have been made to speed up EMT simulation, such as: parallel implementation of the EMT algorithm [4], use of the multi area Thevenin equivalents (MATE) algorithm [5], multi-processor based parallel EMT simulation [6], etc. These approaches have improved the performance of EMT simulations.…”
Section: Introductionmentioning
confidence: 99%