MétaCan
Menu
Back to cohort
Record W4393970831 · doi:10.1002/9781119763222.ch18

Methods Based on Rational Function Approximation of Green's Function Spectra

2024· other· en· W4393970831 on OpenAlexaff

Bibliographic record

Venuenot available
Typeother
Languageen
FieldEngineering
TopicAdvanced Algorithms and Applications
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsFunction (biology)Rational functionMathematicsSpectral lineApplied mathematicsMathematical analysisPhysicsBiologyQuantum mechanicsEvolutionary biology

Abstract

fetched live from OpenAlex

In this chapter, the authors describe the rational function fitting method (RFFM) and spectral differential equation approximation method (SDEAM), which shift the burden of numerical computations from the evaluation of the slowly converging and highly oscillating Sommerfeld integrals to the approximation of their integrands with rational functions, which enable use of standard identities allowing for analytic evaluation of these integrals. The vector fitting-based RFFM requires availability of the analytic solution of the one-dimensional boundary value problems for the spectra of vector potential components. SDEAM solutions both for the vector potential Green's function components in the traditional formulation and mixed-potential Green's function components discussed can be performed with high-order discontinuous Galerkin method. By analogy with planar layered medium, casting of the Green's function spectrum into the pole-residual form allows to evaluate space domain Green's function in spherical layered medium in closed-form as well Okhmatovski and Cangellaris.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.003

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.012
GPT teacher head0.273
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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Algorithms and ApplicationsFrench-language works237,207