{"paper_id":"2308.04629","title":"Instabilities of explicit finite difference schemes with ghost points on the diffusion equation","authors":["Fabien Le Floc'h"],"paper_date":"2023-08-08","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2308.04629v2","page_url":"https://thequant.space/flowcharts/instabilities-of-explicit-finite-difference-schemes-with-gho/","scores":{"empirical_rigor":3,"math_complexity":7.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper investigates the impact of ghost (fictitious) points on the stability of the explicit Euler finite difference scheme for the diffusion equation, focusing on a one-touch option under the Black‑Scholes model.","quote":"We explore in this paper the impact of ghost points on the stability of the explicit Euler finite difference scheme in the context of the diffusion equation.","summary":"Ghost, or fictitious points allow to capture boundary conditions that are not located on the finite difference grid discretization. We explore in this paper the impact of ghost points on the stability of the explicit Euler finite difference scheme in the context of the diffusion equation. In…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The non‑diagonal elements of the discretisation matrix are assumed non‑negative, i.e., |(r_k‑q_k)| ≤ σ^2 S_i ΔS for all i.","type":"model","stated":"explicit","quote":"3 of 6 We assume the non-diagonal elements to be non-negative2, that is |(rk −qk)| ≤σ2Si δS for i = 1,...,n which is always possible to enforce by reducing δS accordingly.","support":"full"},{"assumption":"The interest rate r_k is assumed non‑negative.","type":"market","stated":"explicit","quote":"(6) We will further assume that rk ≥0.","support":"full"},{"assumption":"Convergence of the explicit scheme is required to satisfy the infinity‑norm bound ‖I+Â‖_∞ ≤ 1.","type":"model","stated":"explicit","quote":"To guarantee convergence of the explicit scheme, we require ∥I + ˜A∥∞≤1 .","support":"full"},{"assumption":"The payoff at the lower boundary S=0 is assumed linear (or diffusion zero) so that a first‑difference approximation can be used.","type":"model","stated":"explicit","quote":"The boundary condition at S0 = 0 reads V k+1 0 −V k 0 δt = (rk −qk)S0 V k 1 −V k 0 δS −rkV k 0 , where we used a first difference approximation for the first derivative, and assumed the payoff to be linear (or equivalently the diffusion to be zero) at S = S0.","support":"full"},{"assumption":"When the barrier level is on the grid, the stability condition reduces to the same as Equation 7.","type":"model","stated":"explicit","quote":"(7) When the barrier level is on the grid, we have Su = L+ and the condition at i = u −1 also verifies Equation 7.","support":"full"},{"assumption":"The analysis assumes a uniform grid and uses ghost points to enforce boundary conditions.","type":"model","stated":"explicit","quote":"An alternative technique is to keep the grid simple (for example uniform) and use ghost points1 to enforce the boundary condition(s) [Wilmott 2013, p. 1209–1210].","support":"full"}]},"datasets":{"status":"available","items":[{"name":"One‑touch option numerical example","provider":null,"kind":"options","access":"unknown","period":null,"universe":null,"quote":"Numerical results We consider a one touch option of maturity T = 1 year and barrier L+ = 7581.36, on an asset of spot price S = 6317.80 with rates r = q = 0% and constant volatility σ = 20%. The reference price obtained by an analytical formula is 32.9620%.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R1","candidates":{"front_matter":"n/a","evidence_card":"no","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"The ghost point technique is often not appropriate on the explicit Euler scheme; the scheme becomes unstable as the grid point approaches the barrier level.","kind":"theoretical","quote":"4. Conclusion The ghost point technique is often not appropriate on the explicit Euler scheme. In the context of a simple one-touch option, the scheme is guaranteed to become unstable as the grid point moves towards the barrier level, regardless of the time-step size.","support":"full"},{"finding":"Inserting a point at the barrier level on the grid worsens stability, causing divergence for larger time‑steps.","kind":"theoretical","quote":"Inserting a point at the barrier level on the grid is worse, as the divergence will appear for larger time-steps.","support":"full"},{"finding":"For L‑stable implicit schemes, no oscillation is observed and the ghost point technique is as accurate as a smooth grid deformation.","kind":"theoretical","quote":"For L-stable implicit schemes, no oscillation is visible and the ghost point technique is found as accurate as the placement of the barrier level on the grid by a smooth deformation.","support":"full"},{"finding":"For the A‑stable Crank‑Nicolson scheme, a very localized oscillation appears close to the boundary when using ghost points.","kind":"theoretical","quote":"For the A-stable Crank-Nicolson scheme, a very localized oscillation is present close to the boundary. Healy, Jherek. 2022.","support":"full"},{"finding":"When the barrier falls between two grid points, the timestep restriction from the ghost‑point analysis matches that of the standard explicit scheme.","kind":"theoretical","quote":"When the barrier falls in the middle of two grid points, the timestep restriction from Equation 8 becomes the same as the one from Equation 7. 3.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":14,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T20:01:51Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}