MétaCan
Menu
Back to cohort
Record W2147653819 · doi:10.1109/tmag.2005.844545

Meshless method based on orthogonal basis for computational electromagnetics

2005· article· en· W2147653819 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 · 2005
Typearticle
Languageen
FieldEngineering
TopicNumerical methods in engineering
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsElectromagneticsGalerkin methodBasis (linear algebra)Basis functionApplied mathematicsComputational electromagneticsPolynomial basisComputer scienceOrthogonal basisPartial differential equationBoundary value problemFinite element methodMathematical optimizationMathematicsMathematical analysisElectromagnetic fieldGeometryPhysics

Abstract

fetched live from OpenAlex

This paper discovers and researches problems on numerical oscillations of the solution in element-free Galerkin method (EFGM) when it uses high order polynomial basis, and puts forward the meshless method based on orthogonal basis (MLMBOB), which is composed of essential boundary conditions with Penalty method, then gets the numerical solutions of the partial differential equations. This method holds nearly all qualities of EFGM and removes many drawbacks of it, and it has high accuracy when high order orthogonal basis is used. Therefore, it is fit for many problems in engineering computational electromagnetics. Examples are given to prove 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.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.328
Threshold uncertainty score1.000

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.014
GPT teacher head0.275
Teacher spread0.261 · 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