MétaCan
Menu
Back to cohort
Record W4409709049 · doi:10.1142/s0218348x25401425

SOLVING TIME-FRACTIONAL FISHER MODELS BY NON-POLYNOMIAL SPLINES IN TERMS OF LOGARITHMIC DERIVATIVES

2025· article· en· W4409709049 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

VenueFractals · 2025
Typearticle
Languageen
FieldMathematics
TopicFractional Differential Equations Solutions
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsLogarithmMathematicsApplied mathematicsPolynomialFractional calculusMathematical analysis

Abstract

fetched live from OpenAlex

This paper introduces a novel numerical approach, the logarithmic non-polynomial spline method (LNPSM), leveraging a non-polynomial spline function with logarithmic terms to solve the conformable time-fractional Fisher (TFF) equation. The developed scheme achieves six-order convergence, derived through truncation error analysis and the Taylor series expansion. Stability is ensured under conditional constraints verified by von Neumann stability analysis. The method’s accuracy is demonstrated through two test examples, with results presented in comparison tables alongside cubic B-spline and Caputo non-polynomial spline methods, evaluated by norm errors. Additionally, graphical representations, including 2D and 3D plots, further illustrate the effectiveness of LNPSM. The findings indicate that LNPSM is a suitable and robust tool for solving time-fractional differential equations.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.583
Threshold uncertainty score0.691

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.026
GPT teacher head0.313
Teacher spread0.287 · 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