Accelerating Convergence in Trinomial Option Pricing: Recursive Incremental Value Ordering with Repeated Richardson Extrapolation
Bibliographic record
Abstract
The Black-Scholes model, widely utilized for option pricing, has evolved into a trinomial model approach, providing an alternative means for determining option prices.Nonetheless, the trinomial model faces limitations in terms of time efficiency and accuracy.This study explores the acceleration of the trinomial option prices' convergence and computation time reduction using repeated Richardson extrapolation (RRE), achieved by recursively determining the order of incremental values.Comparative analysis with other extrapolation methods revealed that the RRE technique outperforms the Aitken Neville method by approximately 11%.Applied to a case study involving technology and energy stock option pricing, this technique minimized the required time steps to an average of 0.04 seconds, simultaneously achieving a mean square error (MSE) value of 0.835 compared to the Black-Scholes value.Consequently, the proposed methodology offers potential enhancements in computational efficiency for financial applications employing nested discrete-time models.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".