Steady-State Simulation Methods of Closed-Loop Power Converter Systems—A Systematic Solution Procedure
Bibliographic record
Abstract
While a host of analysis techniques exist to perform steady-state analysis of open-loop converter systems, solutions for close-loop converter systems are distinctly more challenging to obtain. Analysis is done either via computationally intensive time-domain simulation or through reliance on a disconnected collection of published iteration techniques. Moreover, most of these iteration techniques deal with a system containing only one or two converters. This is not adequate to deal with a smart grid or microgrid system, which consists of multiple (more than two) converters. This paper proposes a generalized and systematic solution procedure to obtain the steady state of a system containing multiple closed-loop power converters, in a computationally efficient manner. The solution procedure consists of a general five step approach that can easily be applied to a wide variety of power converter systems. It is shown that numerous previously proposed methods may be viewed as specific implementations of the generalized systematic procedure. A new solution approach, suitable for analysis of tightly coupled multiconverter networks, is developed based on the generalized solution procedure. Results of the new approach are validated against PSCAD/EMTDC simulations for a representative multiconverter network.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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.004 | 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".