MétaCan
Menu
Back to cohort
Record W2110310147 · doi:10.1364/ol.34.000917

Efficient iterative solution of the discrete dipole approximation for magnetodielectric scatterers

2009· article· en· W2110310147 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

VenueOptics Letters · 2009
Typearticle
Languageen
FieldPhysics and Astronomy
TopicRandom lasers and scattering media
Canadian institutionsSaint Paul University
Fundersnot available
KeywordsIterative methodMagnetic dipoleDiscrete dipole approximationPhysicsOpticsDipoleScatteringLinear systemLight scatteringElectric fieldLinear approximationMagnetic fieldComputational physicsMathematical analysisMathematicsMathematical optimizationQuantum mechanicsNonlinear system

Abstract

fetched live from OpenAlex

The discrete dipole approximation (DDA) has been widely used to study light scattering by nonmagnetic objects. The electric field inside an arbitrary scatterer is found by solving a dense, symmetric, linear system using, in general, an iterative approach. However, when the scatterer has a nonzero magnetic susceptibility, the linear system becomes nonsymmetric, and some of the most commonly used iterative methods fail to work. We study the scattering of light by objects with both electric and magnetic linear responses and discuss the efficiency of several iterative solvers for the nonsymmetric DDA.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.716
Threshold uncertainty score0.267

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.006
GPT teacher head0.215
Teacher spread0.209 · 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