Splitting State-Space Method for Converter-Integrated Power Systems EMT Simulations
Bibliographic record
Abstract
As the utilization of power electronic-based components in power systems continues to grow, a comprehensive understanding of their dynamics becomes increasingly important for system design, control and protection analysis. To meet practical needs, the high-fidelity but time-consuming electromagnetic transient (EMT) simulations are often required. To improve the performance of these simulations, a highly efficient splitting state-space method with numerical error control is proposed that reduces the computation workload. The method employs a generic decoupling principle to split the state-space equations of the converter-integrated power system and introduces the exponential splitting formulas of multiple orders accuracy to solve and then compose the splitting state-space equations. The decoupling principle is designed based on separation of time-varying portions of the state matrix, which is realized by locating the smallest subcircuit topology that is switch state-dependent, through automatic switch grouping and switch adjacent state variables (SASV) identification. A family of exponential splitting schemes is employed to accelerate the demanding matrix exponential calculation. The splitting state-space method undergoes comprehensive testing across various cases, including a distribution network with DC load, an LLC resonant converter, a large-scale wind farm, and an MMC circuit. The accuracy of the proposed method is thoroughly evaluated, and its efficiency is validated.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".