Dynamic Phasor Finite-Element Modeling of a DFIG for Grid Connection Studies
Bibliographic record
Abstract
Cosimulation studies of electric power systems and electric machines have always been a challenge. In order to reduce the simulation time to a reasonable value, lumped-parameter electric machine models are commonly used in electric power system modeling software packages to avoid the heavy computational burden of more accurate modeling methods especially finite-element method (FEM) on the expense of less accuracy. The proposed technique in this article combines the dynamic phasor modeling technique for power system simulations with the FEM to accurately model the doubly fed induction generator while connected to the grid. The utilization of dynamic phasors enables adopting large simulation time steps resulting in a significant reduction in the simulation time compared to the conventional time-domain FEM modeling. The mathematical foundation of the proposed modeling method is presented including the generator's core saturation. Custom-written C++ codes have been developed by the authors to execute the new dynamic phasor FEM algorithm and the conventional time-domain FEM in order to fairly compare their accuracy and numerical performances. As the proposed method combines time and frequency domains, a unique capability of modeling the rotor movement can be achieved. The rotation can be represented by physically incrementing the rotor and airgap mesh as in regular time-domain solvers, by mathematically representing the rotation using the virtual blocked rotor method as in frequency-domain solvers, and the proposed method of combining the two aforementioned approaches. The three methods of modeling rotor rotation are discussed, and their simulation results are compared to give a guide to choose the proper method for the different modeling targets. The results show that the proposed dynamic phasor FEM is capable of producing comparable results to the traditional time-domain solver at a substantially reduced simulation time.
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.000 |
| 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.000 |
| 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".