MétaCan
Menu
Back to cohort
Record W3132259949 · doi:10.1088/1402-4896/abe066

A cubic B-spline collocation method with new approximation for the numerical treatment of the heat equation with classical and non-classical boundary conditions

2021· article· en· W3132259949 on OpenAlexaff
Asifa Tassaddiq, Muhammad Yaseen, Aatika Yousaf, Rekha Srivastava

Bibliographic record

VenuePhysica Scripta · 2021
Typearticle
Languageen
FieldMathematics
TopicDifferential Equations and Boundary Problems
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsDiscretizationCollocation methodMathematicsCollocation (remote sensing)PiecewiseInterpolation (computer graphics)Applied mathematicsSpline interpolationMathematical analysisB-splineConvergence (economics)Stability (learning theory)Boundary value problemComputer scienceDifferential equationOrdinary differential equation

Abstract

fetched live from OpenAlex

Abstract In this paper, a cubic B-spline collocation method equipped with new approximations for second-order derivatives is used to approximate the solution of the heat equation. This technique depends on the typical finite difference scheme to discretize the time derivative while cubic B-splines are utilized as interpolation functions in the space dimension. The key advantage of using this approach is that the solution is obtained as a piecewise continuous function empowering one to find approximation at any desired location of the domain. The stability and convergence analysis of the presented method are studied rigorously. The capability of the scheme is checked by some test problems. The effectiveness and exactness of the proposed method are confirmed by computing the error norms. Numerical results are contrasted with some existing numerical schemes to exhibit the predominance of our scheme.

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.001
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

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

Citations6
Published2021
Admission routes1
Has abstractyes

Explore more

Same venuePhysica ScriptaSame topicDifferential Equations and Boundary ProblemsFrench-language works237,207