{"paper_id":"2512.24714","title":"Boundary error control for numerical solution of BSDEs by the convolution-FFT method","authors":["Xiang Gao","Cody Hyndman"],"paper_date":"2025-12-31","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2512.24714v1","page_url":"https://thequant.space/flowcharts/boundary-error-control-for-numerical-solution-of-bsdes-by-th/","scores":{"empirical_rigor":2.5,"math_complexity":9,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a modified convolution‑FFT method that uses exponential damping and a tailored shifting function to reduce boundary errors in BSDE option pricing.","quote":"We then propose a method for improving the boundary errors obtained when valuing options using this approach.","summary":"We first review the convolution fast-Fourier-transform (CFFT) approach for the numerical solution of backward stochastic differential equations (BSDEs) introduced in (Hyndman and Oyono Ngou, 2017). We then propose a method for improving the boundary errors obtained when valuing options using this…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The functions η, σ, f, and g are uniformly Lipschitz continuous with bounded first‑order derivatives in the space variables.","type":"model","stated":"explicit","quote":"The functions η, σ, f, and g are uniformly Lipschitz continuous with bounded ﬁrst order derivatives in the space variables, for all t ∈[0, T ]: |η(t, u) −η(t, v)| ≤K(|u −v|), …"},{"assumption":"The volatility matrix Σ(t,x)=σ(t,x)σ⊤(t,x) is continuous and L2‑bounded (‖Σ‖2 ≤ C).","type":"model","stated":"explicit","quote":"The volatility Σ(t, x) = σ(t, x)σ⊤(t, x) is continuous and L2‑bounded ∥Σ∥2 ≤C, for some positive constant C."}]},"datasets":{"status":"available","items":[{"name":"Synthetic European call option example","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"We choose that S0 = 100, K = 100, d = 0, r = R = 0.01, µ = 0.05, σ = 0.2, and T = 1."}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"pricing-calibration","findings":[{"finding":"Time‑dependent shifting reduces boundary error significantly.","kind":"theoretical","quote":"Time‑dependent shifting reduces boundary error significantly."},{"finding":"The modified method yields a smooth and accurate delta surface at the boundaries, unlike the original scheme where delta explodes.","kind":"performance","quote":"Figure 3 demonstrates that our method displays the entire delta surface which is smooth and very accurate at the boundaries."},{"finding":"Numerical results show the proposed method has better accuracy than the original Hyndman and Oyono Ngou (2017) convolution algorithm.","kind":"performance","quote":"The numerical result shows that our method has better accuracy than the original method given by Hyndman and Oyono Ngou (2017)."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":20,"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":1,"extracted_at":"2026-11-14T17:17:20Z"},"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/"}