MétaCan
Menu
Back to cohort
Record W2593831893 · doi:10.1137/120892465

Unconditionally Optimal Error Estimates of a Crank--Nicolson Galerkin Method for the Nonlinear Thermistor Equations

2014· article· en· W2593831893 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

VenueSIAM Journal on Numerical Analysis · 2014
Typearticle
Languageen
FieldMathematics
TopicNumerical methods in inverse problems
Canadian institutionsToronto Metropolitan University
FundersCity University of Hong KongNational Science Foundation
KeywordsDiscretizationMathematicsGalerkin methodCrank–Nicolson methodNonlinear systemFinite element methodApplied mathematicsError analysisDiscretization errorDiscontinuous Galerkin methodNumerical analysisApproximation errorMathematical analysisTemporal discretization

Abstract

fetched live from OpenAlex

This paper focuses on unconditionally optimal error analysis of an uncoupled and linearized Crank-Nicolson Galerkin finite element method for the time-dependent nonlinear thermistor equations in <i>d</i>-dimensional space, <i>d</i> = 2, 3. In our analysis, we split the error function into two parts, one from the spatial discretization and one from the temporal discretization, by introducing a corresponding time-discrete (elliptic) system. We present a rigorous analysis for the regularity of the solution of the time-discrete system and error estimates of the time discretization. With these estimates and the proved regularity, optimal error estimates of the fully discrete Crank-Nicolson Galerkin method are obtained unconditionally. Numerical results confirm our analysis and show the efficiency of the method.

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.009
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Insufficient payload (model declined to judge)
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.339
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.009
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.079
GPT teacher head0.407
Teacher spread0.328 · 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