Adaptive-Grained Exponential Integrator Algorithm for Efficient Simulation of Power Converter Systems
Bibliographic record
Abstract
Electromagnetic transient (EMT) simulation is increasingly important for complex power electronic converter system design and validation. This paper proposes an adaptive-grained exponential integrator (AGEI) algorithm designed to efficiently simulate power electronic networks. The AGEI algorithm relies on precomputation of carefully-chosen discretization steps to reduce memory burden. It then performs sequential intermediate integrations between discrete switching events to accelerate transient simulation. The variable time-step, high-order integration algorithm finds a balance between simulation run-time and computational overhead. The AGEI algorithm varies the number of the forcing function terms to meet desirable error thresholds. The proposed algorithm is L-stable and can be flexibly applied to stiff and non-stiff circuit systems, rendering it suitable for a wide arrange of power converter topologies and parameters. A hardware experimental study validates the AGEI algorithm's accuracy while simulation case studies demonstrate the AGEI algorithm significantly improves numerical efficiency. It is shown in the typical converter case studies that the proposed algorithm enables more than 8-fold and 3-fold simulation speedup compared to popular simulation tools, i.e., Simulink and PLECS, respectively. The numerical efficiency gains of the proposed algorithm become more apparent for power converter circuits with only-DC input sources or stiff circuit systems.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".