MétaCan
Menu
Back to cohort
Record W1986383846 · doi:10.1109/mwsym.2007.380197

Efficient Mixed-order FDTD Using the Laguerre Polynomials on Non-uniform Meshes

2007· article· en· W1986383846 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 MTT-S International Microwave Symposium digest · 2007
Typearticle
Languageen
FieldEngineering
TopicElectromagnetic Simulation and Numerical Methods
Canadian institutionsDalhousie University
Fundersnot available
KeywordsLaguerre polynomialsFinite-difference time-domain methodPolygon meshGridLaguerre's methodBoundary (topology)MathematicsApplied mathematicsBoundary value problemFinite difference methodPolynomialStability (learning theory)Mathematical analysisMathematical optimizationComputer scienceGeometryOpticsPhysicsOrthogonal polynomials

Abstract

fetched live from OpenAlex

In this paper, we propose a mixed-order approximating method to improve the computational efficiency of the FDTD using the weighted Laguerre polynomial technique. In it, both low-and high-order spatial approximations are used together with a non-uniform mesh; in the interior of a solution domain, a coarse grid is employed and a high-order spatial finite-difference approximation is applied; in a region close to a boundary, a fine grid is used and a low-order spatial finite-difference approximation is applied; As a result, a minimum number of numerical grid cells is used while the boundary handling difficulty with high-order schemes are avoided at no expense of the accuracy and the unconditional stability of the Laguerre-polynomial based FDTD method. Numerical experiments illustrate the effectiveness of the proposed method in improving computational efficiency.

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.001
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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.135
Threshold uncertainty score0.967

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.278
Teacher spread0.263 · 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