Partial Element Equivalent Circuit Based Parallel Electromagnetic Transient Simulation on GPU
Bibliographic record
Abstract
The partial element equivalent circuit (PEEC) method effectively solves Maxwell’s equations in integral form by converting electromagnetic field components into the electrical circuit domain. This article proposes a novel transmission line modeling (TLM) based parallel PEEC time-domain solver to solve nonlinear electromagnetic problems. The method substitutes both linear and nonlinear components in the standard PEEC equivalent circuit with corresponding TLM models, leading to an electrical current-based linear network and a magnetic current-based nonlinear network. The proposed TLM-PEEC method effectively decouples the nonlinear elements from the linear network, enabling individual solutions for the nonlinearities and making it highly suitable for parallel processing. Each nonlinear element is solved using parallel Newton-Raphson (N-R) iterations, and the analytical calculation of the Jacobian is presented along with the algorithm. The parallelization of the TLM-PEEC method is explored and implemented on a many-core graphics processing unit (GPU) and a multi-core central processing unit (CPU) to provide detailed field-oriented information on electromagnetic transients in a single-phase 2-D shell-type transformer. The proposed architecture was easily coupled with an external network, and the accuracy and computational efficiency of the TLM-PEEC method were verified through similar simulation results obtained from 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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| 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.007 | 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".