MétaCan
Menu
Back to cohort

A PRIORI ERROR ANALYSIS OF STOCHASTIC GALERKIN PROJECTION SCHEMES FOR RANDOMLY PARAMETRIZED ORDINARY DIFFERENTIAL EQUATIONS

2016· article· en· W2507205846 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

VenueInternational Journal for Uncertainty Quantification · 2016
Typearticle
Languageen
FieldDecision Sciences
TopicProbabilistic and Robust Engineering Design
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMathematicsApplied mathematicsA priori and a posterioriGalerkin methodDiscretizationOrdinary differential equationNonlinear systemStochastic differential equationProjection (relational algebra)Differential equationMathematical analysisAlgorithm

Abstract

fetched live from OpenAlex

Generalized polynomial chaos (gPC) based stochastic Galerkin methods are widely used to solve randomly parametrized ordinary differential equations (RODEs). These RODEs are parametrized in terms of a finite number of independent and identically distributed second-order random variables. In this paper, we derive a priori error estimates for stochastic Galerkin approximations of RODEs accounting for the temporal and stochastic discretization errors. Under appropriate stochastic regularity assumptions, convergence rates are provided for first-order linear RODE systems and first-order nonlinear scalar RODEs. We also consider the case of second-order linear RODE systems that are routinely encountered in stochastic structural dynamics applications. Finally, some insights into the long-time behavior of gPC schemes are provided for a model problem drawing on the present analysis.

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.003
metaresearch head score (Gemma)0.021
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch
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.954
Threshold uncertainty score0.988

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.021
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0020.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.191
GPT teacher head0.436
Teacher spread0.245 · 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