MétaCan
Menu
Back to cohort
Record W7133013508

Reduced-order Modeling in the Finite-difference Time-Domain Method

2020· dissertation· W7133013508 on OpenAlexaff
Xinyue (Leo) Zhang

Bibliographic record

VenueTSpace · 2020
Typedissertation
Language
FieldEngineering
TopicElectromagnetic Simulation and Numerical Methods
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsFinite-difference time-domain methodGridStability (learning theory)Scheme (mathematics)Field (mathematics)Domain (mathematical analysis)Reduction (mathematics)
DOInot available

Abstract

fetched live from OpenAlex

The finite-difference time-domain (FDTD) method is a well-known numerical algorithm. Despite its many advantages, FDTD becomes time-consuming when applied to multiscale problems, where sharp field variations or fine geometrical details impose a very fine grid, at least locally. Grid refinement affects computational cost in two ways: it increases the number of fields to update at each iteration, and it reduces the maximum timestep allowed by the Courant-Friedrichs-Lewy (CFL) stability limit. Our goal is to investigate how model order reduction (MOR) can be leveraged to address both computational issues associated with grid refinement, and devise accelerated FDTD schemes for multiscale problems. In the envisioned approach, multiscale objects are initially meshed with a locally-refined grid, while the rest of the domain is meshed with a coarse grid. Then, the FDTD update equations of each refined region are processed to generate a reduced-order model, which is finally coupled to the surrounding coarse grid. To achieve this vision, two main issues had to be addressed: i) how to generate FDTD-compatible reduced-order models, and ii) how to guarantee that the final FDTD scheme with embedded reduced models will be stable under a known CFL limit. Our first major contribution is to devise a new theoretical framework to create FDTD-like schemes with provable stability, based on the dissipativity theory. We show that most FDTD schemes can be seen as the connection of different subsystems, such as reduced-order models. We determine the conditions under which these FDTD-like subsystems are dissipative, and prove that, if each subsystem is dissipative, then the whole scheme will be dissipative, and thus stable. This theory provides a systematic way to create a variety of FDTD schemes with provable stability, from simple subgridding algorithms to the advanced FDTD schemes with embedded reduced-order models. Another major contribution is to generate reduced-order models compatible with FDTD simulations, and capable of accurately capturing the electromagnetic behaviour of a given volume enclosing arbitrary objects. The proposed models can be instantiated into a coarser FDTD grid and are compatible with leap-frogging. Through the dissipativity theory, we rigorously prove the stability of the proposed FDTD algorithms with reduced models.

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.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
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.0020.001

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.041
GPT teacher head0.366
Teacher spread0.325 · 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
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
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueTSpaceSame topicElectromagnetic Simulation and Numerical MethodsFrench-language works237,207