High-Order Exponential Integrator Algorithm for Real-Time Simulation of Power Electronic Systems
Bibliographic record
Abstract
Real-time (RT) electromagnetic transient simulation is growing in popularity for hardware-in-the-loop (HIL) simulation of physical hardware devices. This article proposes a variable-step high-order RT exponential integrator (RTEI) algorithm that is well suited for HIL studies, particularly for controller HIL studies with digital controllers. The RTEI algorithm relies on the precomputation of matrix exponentials to offload runtime complexity. The RTEI algorithm works at each intracontrol cycle and aims to only recalculate system states at switching events. The proposed solver flexibly adapts the number of forcing function terms to achieve high accuracy with a minimum number of computed points. The proposed algorithm is L-stable, making it generally applicable to power electronic systems. A case study validates the accuracy of the proposed algorithm by comparing it with hardware experimental results. Further case studies benchmark the computational efficiency of the proposed solver with a fixed-step Trapezoidal rule-backward Euler solver (TR-BE), ART5, and an existing discrete hybrid time-step (DHT) algorithm. It is shown that the proposed algorithm achieves over 10-fold and 2-fold efficiency increases in TR-BE and DHT, respectively. The advantages of the proposed algorithm lie in both efficiency increases for general circuit topologies and the stability of the algorithm in the presence of high network stiffness.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.008 | 0.002 |
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".