Real-Time FEM Computation of Nonlinear Magnetodynamics of Moving Structures on FPGA for HIL Emulation
Bibliographic record
Abstract
Finite-element method (FEM) based hardware-in-the-loop emulation provides the most accurate and fast prototype platform for real-time design and testing of electric machines in a nondestructive environment. The application of transmission line modeling (TLM) can expeditiously reduce the FEM execution time by decoupling the nonlinear elements of the FEM equivalent network using transmission lines to keep the stiffness matrix unchanged through the simulation for static cases. However, in electric machines the TLM method suffers from the change of stiffness matrix in the time-stepped procedure due to movement. Furthermore, time consumption for the solution of numerous decoupled nonlinear equations for a fairly large number of TLM iterations in comparison with the conventional Newton-Raphson method remains a challenge. This paper proposes a novel real-time TLM method based on finite precalculated lower and upper triangular decompositions and field programmable gate array hardware implementation to exploit TLM parallelism for real-time simulation of magnetodynamics in electric machines. A two-dimensional FEM simulation of a single-sided linear induction machine is emulated in hardware and the results are validated experimentally and with Jmag-Designer software to show the effectiveness of the proposed method.
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.000 | 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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.005 | 0.000 |
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".