A Fast and Stable Method for Modeling Generalized Nonlinearities in Power Electronic Circuit Simulation and Its Real-Time Implementation
Bibliographic record
Abstract
Nonlinearities have been the major obstructions that limit the computational efficiency in power electronic circuit simulation for a long time. Yet there is no standard way for dealing with them. This paper presents a new method that makes the handling of nonlinearities fast and stable. In the proposed method, nonlinearities are transformed into a uniform representation - a constant resistor in parallel with a companion current source, thus making the system admittance matrix constant for fixed time-step simulation. To solve for the corresponding companion current source, nonlinearities are treated as either current or voltage sources and a diagonal time-varying matrix equation is developed. Three methods are proposed for solving the matrix equation - precomputed inversion or factorization, modified Gaussian elimination, and updating inverse using the Sherman-Morrison formula - that can fit different system sizes and applications. The proposed method is validated by two common power electronic converter topologies, both in offline and real-time simulation. Offline tests show that the proposed method achieved the same accuracy with the mature simulation software while being more than ten times faster. The same test cases are also implemented into field programmable gate arrays based real-time simulation experiments for verification.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".