MétaCan
Menu
Back to cohort
Record W2080841036 · doi:10.4134/bkms.2014.51.4.1087

AN ADAPTIVE FINITE DIFFERENCE METHOD USING FAR-FIELD BOUNDARY CONDITIONS FOR THE BLACK-SCHOLES EQUATION

2014· article· en· W2080841036 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

VenueBulletin of the Korean Mathematical Society · 2014
Typearticle
Languageen
FieldEngineering
TopicElectromagnetic Simulation and Numerical Methods
Canadian institutionsToronto Metropolitan University
FundersDivision of Mathematical SciencesNational Institute for Materials ScienceKorea University
KeywordsMathematicsGridFinite difference methodFinite differenceBoundary value problemBoundary (topology)A priori and a posterioriApplied mathematicsPosition (finance)Field (mathematics)Mathematical optimizationMathematical analysisGeometry

Abstract

fetched live from OpenAlex

We present an accurate and efficient numerical method for solving the Black-Scholes equation. The method uses an adaptive grid technique which is based on a far-field boundary position and the Peclet condition. We present the algorithm for the automatic adaptive grid generation: First, we determine a priori suitable far-field boundary location using the mathematical model parameters. Second, generate the uniform fine grid around the non-smooth point of the payoff and a non-uniform grid in the remaining regions. Numerical tests are presented to demonstrate the accuracy and efficiency of the proposed method. The results show that the computational time is reduced substantially with the accuracy being maintained.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.545
Threshold uncertainty score0.333

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
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.0000.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.035
GPT teacher head0.309
Teacher spread0.274 · 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