MétaCan
Menu
Back to cohort
Record W2015280363 · doi:10.1109/tmtt.2013.2281777

Efficient Analysis of Geometrical Uncertainty in the FDTD Method Using Polynomial Chaos With Application to Microwave Circuits

2013· article· en· W2015280363 on OpenAlexaff
Andrew C. M. Austin, Costas D. Sarris

Bibliographic record

VenueIEEE Transactions on Microwave Theory and Techniques · 2013
Typearticle
Languageen
FieldDecision Sciences
TopicProbabilistic and Robust Engineering Design
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsPolynomial chaosFinite-difference time-domain methodMonte Carlo methodCurvilinear coordinatesPolynomialElectronic circuitAlgorithmMicrostripMicrowaveMathematicsComputer scienceElectronic engineeringMathematical analysisGeometryOpticsPhysicsEngineeringTelecommunicationsElectrical engineering

Abstract

fetched live from OpenAlex

A novel finite-difference time-domain (FDTD)-based method is developed to analyze 3-D microwave circuits with uncertain parameters, such as variability and tolerances in the physical dimensions and geometry introduced by manufacturing processes. The proposed method incorporates geometrical variation into the FDTD algorithm by appropriately parameterizing and distorting the rectilinear and curvilinear computational lattices. Generalized polynomial chaos is used to expand the time-domain electric and magnetic fields in terms of orthogonal polynomial chaos basis functions of the uncertain mesh parameters. The technique is validated by modeling several microstrip circuits with uncertain physical dimensions and geometry. The computed S-parameters are compared against Monte Carlo simulations, and good agreement for the statistics is observed over 0-25 GHz. A considerable computational advantage over the Monte Carlo method is also achieved.

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.000
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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
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.034
GPT teacher head0.322
Teacher spread0.288 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations108
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Microwave Theory and TechniquesSame topicProbabilistic and Robust Engineering DesignFrench-language works237,207