Massively Parallel Hybrid TLM-PEEC Solver and Model Order Reduction for 3D Nonlinear Electromagnetic Transient Analysis
Bibliographic record
Abstract
Electromagnetic (EM) equipments are ubiquitous in electrical power generation, transmission, and distribution systems, and they should be studied for reliable and continuous operation under switching operations, faults, and other transient conditions. Conventional lumped models lack the capability to consider EM field interactions, while distributed methods, such as the finite element method (FEM), are widely employed to address these interactions. The partial element equivalent circuit (PEEC) method has gained interest in EM modeling due to its equivalent circuit behavior and its potential for optimization using circuit solver techniques. This article extends the hybrid transmission line modeling (TLM)-based PEEC 2-D solver for 3-D EM transient simulations, providing detailed information on the matrix solver, time-domain algorithm, the parallelized the Newton–Raphson (N–R) solver for nonlinear magnetics, and a suitable model order reduction (MOR) method. The hybrid TLM–PEEC technique decouples the nonlinear elements from the linear network, providing individual solutions for each unknown through N–R iterations, thereby enabling parallel computing. The proper orthogonal decomposition method, a MOR technique, was integrated into the hybrid TLM–PEEC method to improve performance by removing unnecessary features in the system. The parallelization of the methods has been fully explored and implemented on both many-core graphics processing unit and multicore central processing unit, enabling field-oriented transient simulation for a 3-phase 3-D core-type transformer coupled with external circuits, as well as quasi-static 3-D simulation for a high-voltage insulator. The accuracy and computational efficiency of the proposed architectures were verified through simulation results obtained from similar case studies implemented in Comsol Multiphysics.
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.001 |
| 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".