Memory Compact and Computationally Efficient Methods for Modeling Saturation in Synchronous Machines
Bibliographic record
Abstract
Synchronous machines are commonly used in power generation, electric propulsion, and industrial automation. Accurate modeling of these machines is essential, particularly in addressing challenges posed by nonlinear characteristics such as magnetic saturation. Traditional models often rely on computationally intensive methods to account for these nonlinearities, leading to slow simulations and high memory requirements. This paper introduces two new models: the enhanced explicit flux correction (EFC-2D) model, which captures magnetic saturation using two-dimensional lookup tables (2D-LUTs) with improved computational efficiency, and the single polynomial (S-POLY) model, which represents saturation using polynomials to significantly reduce memory usage. The proposed models are compared to the advanced one-dimensional explicit flux correct model (EFC-1D) and the model in Matlab/Simulink's Simscape Electrical Specialized Power Systems (SPS) toolbox. Simulation results, including both offline and real-time tests, show that EFC-2D and S-POLY models are computationally faster than conventional methods, with S-POLY being more memory-efficient than EFC-1D and EFC-2D models. These improvements make the proposed models ideal for high-performance simulations requiring both speed and memory optimization.
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.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.000 | 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".