MétaCan
Menu
Back to cohort
Record W2091712445 · doi:10.1080/10407790490278002

HIGHER-ORDER METHOD FOR SOLVING FREE BOUNDARY-VALUE PROBLEMS

2004· article· en· W2091712445 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

VenueNumerical Heat Transfer Part B Fundamentals · 2004
Typearticle
Languageen
FieldMathematics
TopicIterative Methods for Nonlinear Equations
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsGratitudeConstructiveMathematicsDomain (mathematical analysis)Order (exchange)Boundary value problemMathematical analysisNonlinear systemApplied mathematicsTransformation (genetics)Calculus (dental)Computer sciencePhysicsPsychology

Abstract

fetched live from OpenAlex

Abstract We present an extended one-step method of order 5 for the solution of the third-order, nonlinear free boundary-value problem. The Falkner-Skan equation as well as the Blasius equation are special cases of this problem. We prove that this method is A- and L-stable. The method uses a coordinate transformation to map a semi-infinite physical domain to the open unit interval (0, 1). Comparisons are made between the numerical solutions obtained by the proposed method and those obtained by previous authors. The author is indebted to Prof. S. E. El-Gendi and Prof. I. A. Hassanien for various valuable suggestions and constructive criticism. We express our gratitude to the (unknown) referees for their comments and suggestions.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.144
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0010.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.105
GPT teacher head0.395
Teacher spread0.290 · 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