MétaCan
Menu
Back to cohort
Record W3099926075

Universal estimate of the gradient for parabolic equations

2008· article· en· W3099926075 on OpenAlexafffund
Nikolai Dokuchaev

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicNumerical methods in inverse problems
Canadian institutionsTrent University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsParabolic partial differential equationMathematical analysisPartial differential equation
DOInot available

Abstract

fetched live from OpenAlex

As is known, the L2-norm of the solution derivatives for parabolic equations can often be estimated via the L2-norm of the free term. We suggest a modification of the corresponding estimate for the solution gradient. We found the limit upper estimate for the gradient that can be achieved by adding a constant to the zero order coefficient of the original equation. The estimate obtained has in limit the same constant for all possible choices of the dimension, domain, time horizon, and the coefficients of the parabolic equation. It why it can be called a universal estimate. AMS 2002 subject classification: 35K10, 35K15, 35K20 Key words and phrases: parabolic equations, regularity, solution gradient

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.004
metaresearch head score (Gemma)0.014
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.014
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.001
Science and technology studies0.0010.003
Scholarly communication0.0010.006
Open science0.0010.006
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0030.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.179
GPT teacher head0.386
Teacher spread0.207 · 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 designTheoretical or conceptual
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

Citations3
Published2008
Admission routes2
Has abstractyes

Explore more

Same topicNumerical methods in inverse problemsFrench-language works237,207