High-Fidelity Memory-Compact Dynamic Model of Interior-Permanent Magnet Synchronous Machines for Motor-Drive Transient Simulations
Bibliographic record
Abstract
Interior permanent magnet synchronous machines (IPMSMs) are often considered in electric vehicles, servomechanisms, aerospace, robotics, industrial automation, etc. In IPMSMs, the flux linkage may vary significantly depending on the design and operating conditions. Detailed models of IPMSMs are required to study their operation in motor-drive applications, where computationally efficient and memory-compact models are highly desirable. The conventional$qd$models may typically use large lookup tables to accurately represent the flux-current relationship over a wide range of operating conditions. Such lookup tables may be obtained from the finite-element analysis at the motor design stage or experimentally for a considered motor prototype, but in general, they have many data points and require significant memory allocation. This paper presents the qd-model of IPMSM, where the lookup tables are replaced with bivariate polynomials, significantly reducing the data points needed to accurately capture the flux-current (and its inverse, current-flux) relationships. The proposed method is demonstrated on simulations of the IPMSM drive with a vector-PI-based field-oriented control (FOC). Using bivariate polynomials reduces the number of data points from around 10,000 to about 100 while achieving similar accuracy, representing a significant improvement over the traditional methods.
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.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.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 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".