MétaCan
Menu
Back to cohort
Record W4234842738 · doi:10.1002/9781119483946.ch5

Discretization and Fixed‐Point Analysis

2018· other· en· W4234842738 on OpenAlexaff
Seyed M. Moghadas, Majid Jaberi‐Douraki

Bibliographic record

VenueMathematical Modelling · 2018
Typeother
Languageen
FieldMathematics
TopicNumerical methods for differential equations
Canadian institutionsYork University
Fundersnot available
KeywordsDiscretizationFixed pointMathematicsContinuous modellingApplied mathematicsStability (learning theory)Discrete systemDiscretization of continuous featuresDomain (mathematical analysis)Fixed-point theoremPoint (geometry)System dynamicsEuler methodEuler's formulaComputer scienceMathematical analysisDiscretization errorAlgorithmGeometry

Abstract

fetched live from OpenAlex

The level of complexity in many mathematical models precludes the formulation of their explicit solutions. Therefore, understanding the qualitative dynamics of such models may require the study of their quantitative behavior. These models often depend on parameters that play crucial roles in system dynamics such as stability and bifurcation. To observe such dynamics, discretization and simulation tools are widely used to approximate the solutions of continuous models in the domain of their variables. The formulation of a discrete system depends on the method used for discretization of the continuous system. The chapter discusses two discretization schemes for deterministic models, including the Euler method, and a nonstandard finite-difference method. The fixed points of a system of difference equations should correspond to the critical points of the underlying continuous system. The fixed-point theorem is applied to analyze the behavior of a discrete system around its fixed points.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.001
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0040.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.084
GPT teacher head0.355
Teacher spread0.271 · 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
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
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueMathematical ModellingSame topicNumerical methods for differential equationsFrench-language works237,207