Barycentric spectral domain decomposition methods for valuing a class of infinite activity Lévy models
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.
Bibliographic record
Abstract
A new barycentric spectral domain decomposition methods algorithm for solving partial integro-differential models is described. The method is applied to European and butterfly call option pricing problems under a class of infinite activity Lévy models. It is based on the barycentric spectral domain decomposition methods which allows the implementation of the boundary conditions in an efficient way. After the approximation of the spatial derivatives, we obtained the semi-discrete equations. The computation of these equations is performed by using the barycentric spectral domain decomposition method. This is achieved with the implementation of an exponential time integration scheme. Several numerical tests for the pricing of European and butterfly options are given to illustrate the efficiency and accuracy of this new algorithm. We also show that Greek options, such as Delta and Gamma sensitivity, are computed with no spurious oscillation.
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 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.001 | 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 it