{"paper_id":"2512.05326","title":"Convolution-FFT for option pricing in the Heston model","authors":["Xiang Gao","Cody Hyndman"],"paper_date":"2025-12-05","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2512.05326v1","page_url":"https://thequant.space/flowcharts/convolution-fft-for-option-pricing-in-the-heston-model/","scores":{"empirical_rigor":7,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a convolution-FFT method for pricing European options under the Heston model.","quote":"We propose a convolution-FFT method for pricing European options under the Heston model that leverages a continuously differentiable representation of the joint characteristic function.","summary":"We propose a convolution-FFT method for pricing European options under the Heston model that leverages a continuously differentiable representation of the joint characteristic function. Unlike existing Fourier-based methods that rely on branch-cut adjustments or empirically tuned damping…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The conditional density depends only on the increment of the log‑price for short time steps (translation‑invariance approximation).","type":"model","stated":"explicit","quote":"φ(xt | x, v) = φ(xt −x | v), (3.5) as an approximation valid for short time increments ∆t"},{"assumption":"Over a small time step ∆t the conditional distribution of the log‑price is well approximated by a Gaussian with variance v.","type":"model","stated":"explicit","quote":"over a small time step ∆t the conditional distribution of xt is well approximated by a Gaussian with variance v"},{"assumption":"Damping and shifting transformations are applied to make the target function bounded and integrable for the FFT.","type":"other","stated":"explicit","quote":"To make the target function bounded and integrable, we introduce a damping parameter and write the Fourier transform of the convolution as a product"}]},"datasets":{"status":"none_found","items":[],"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":"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":"The CFFT‑I method outperforms the standard FFT method except at‑the‑money, where FFT retains slightly higher precision.","kind":"performance","quote":"The CFFT‑I method outperforms the FFT method except at the money, where the FFT method retains slightly higher precision."},{"finding":"CFFT‑II converges as the grid size N increases and provides a significant computational speed advantage over FFT.","kind":"performance","quote":"The CPU times in Table 4.1 indicate that CFFT‑II has a signiﬁcant computational speed advantage over FFT."},{"finding":"Numerically, the CFFT method achieves comparable or superior accuracy with smaller grids and reduced computation time, while eliminating the need for damping‑parameter calibration.","kind":"theoretical","quote":"Numerically, the CFFT method achieves comparable or superior accuracy with smaller grids and reduced computation time, while eliminating the need for damping‑parameter calibration required in the Carr and Madan approach."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":70,"citations":{"cited_by_in_corpus":1,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":1},"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:19:54Z"},"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/"}