MétaCan
Menu
Back to cohort
Record W2814565151 · doi:10.1109/tmag.2018.2848622

Matrix-Free Nodal Domain Decomposition With Relaxation For Massively Parallel Finite-Element Computation of EM Apparatus

2018· article· en· W2814565151 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Magnetics · 2018
Typearticle
Languageen
FieldEngineering
TopicElectromagnetic Simulation and Numerical Methods
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsDomain decomposition methodsSpeedupMassively parallelParallel computingComputer scienceSolverRelaxation (psychology)Node (physics)Finite element methodDomain (mathematical analysis)Computational scienceNonlinear systemAlgorithmPhysicsMathematics

Abstract

fetched live from OpenAlex

In this paper, the nodal domain decomposition with relaxation (NDDR) scheme is proposed to solve the nonlinear finite-element (FE) problem in electromagnetic apparatus without assembling the global system of equations. Each sub-domain contains only one node with unknown magnetic vector potential, and the calculation of each sub-domain can be massively parallelized to utilize the prevalent parallel computing architectures. The sub-domain solver has excellent modularity for single instruction multiple data programming with a specific data structure, and the required memory shows a linear increase with the problem size. The NDDR scheme is implemented on both multi-core CPUs and many-core GPUs, and the accuracy and efficiency are discussed for different problem sizes. Result comparison with a commercial FE package shows a speedup of more than 30 times for a magnetostatic case and an average speedup of more than 53 times for a time-domain nonlinear FE case with different time steps while maintaining an error of less than 0.85%.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.545
Threshold uncertainty score0.682

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.013
GPT teacher head0.286
Teacher spread0.273 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it