Paper: arXiv 2512.05326

Authors: Xiang Gao, Cody Hyndman

Abstract

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 parameters, our approach yields a stable integrand even under large frequency oscillations. Crucially, we derive fully analytical error bounds that quantify both truncation error and discretization error in terms of model parameters and grid settings. To the best of our knowledge, this is the first work to provide such explicit, closed-form error estimates for an FFT-based convolution method specialized to the Heston model. Numerical experiments confirm the theoretical rates and illustrate robust, high-accuracy option pricing at modest computational cost.

Complexity vs Empirical Score

  • Math Complexity: 8.5/10
  • Empirical Rigor: 7.0/10
  • Quadrant: Holy Grail — high math complexity, high empirical rigor

Why this score: The paper involves advanced mathematical concepts including stochastic differential equations, characteristic functions, and deriving explicit analytical error bounds, indicating high math complexity. The empirical rigor is high due to detailed numerical experiments that confirm theoretical rates and compare with established methods like the Carr-Madan approach, though it lacks raw code or datasets, focusing more on algorithmic implementation.

Research Flowchart

  flowchart TD
  A["Research Goal: Develop a stable<br>FFT method for Heston model<br>with analytical error bounds"] --> B["Methodology: Derive continuously<br>differentiable characteristic function<br>for convolution-FFT method"]
  
  B --> C{"Inputs & Setup"}
  C --> C1["Heston Model Parameters<br>Variance, Volatility of Volatility, Correlation"]
  C --> C2["Numerical Grid Settings<br>Discretization steps, Truncation limit"]
  
  C1 & C2 --> D["Computational Process:<br>Fast Fourier Transform<br>on discretized characteristic function"]
  
  D --> E["Key Findings:<br>• Fully analytical error bounds<br>• Stable integrand without damping<br>• High accuracy at modest cost<br>• First explicit error estimates for Heston FFT"]
  
  style A fill:#e1f5fe
  style B fill:#fff3e0
  style C fill:#f3e5f5
  style C1 fill:#e8f5e8
  style C2 fill:#e8f5e8
  style D fill:#fce4ec
  style E fill:#e8f5e8

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper proposes a convolution-FFT method for pricing European options under the Heston model.

Source sentence
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.

Assumes 3

  • The conditional density depends only on the increment of the log‑price for short time steps (translation‑invariance approximation). model
    Source sentence
    φ(xt | x, v) = φ(xt −x | v), (3.5) as an approximation valid for short time increments ∆t
  • Over a small time step ∆t the conditional distribution of the log‑price is well approximated by a Gaussian with variance v. model
    Source sentence
    over a small time step ∆t the conditional distribution of xt is well approximated by a Gaussian with variance v
  • Damping and shifting transformations are applied to make the target function bounded and integrable for the FFT. other
    Source sentence
    To make the target function bounded and integrable, we introduce a damping parameter and write the Fourier transform of the convolution as a product

Data

No dataset named in the text.

Costs

Not applicable The paper reports no trading or execution result.

Finds 3

  • The CFFT‑I method outperforms the standard FFT method except at‑the‑money, where FFT retains slightly higher precision. performance
    Source sentence
    The CFFT‑I method outperforms the FFT method except at the money, where the FFT method retains slightly higher precision.
  • CFFT‑II converges as the grid size N increases and provides a significant computational speed advantage over FFT. performance
    Source sentence
    The CPU times in Table 4.1 indicate that CFFT‑II has a significant computational speed advantage over FFT.
  • Numerically, the CFFT method achieves comparable or superior accuracy with smaller grids and reduced computation time, while eliminating the need for damping‑parameter calibration. theoretical
    Source sentence
    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.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 70 related papers). Coverage is partial, so this is neither replication nor refutation.

Cited by 1 paper in the archive

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.

Cited References (19)

  1. Stochastic control, numerical methods, and machine learning in finance and insurance (2021) — link
  2. The F okker- P lanck Equation (1996)
  3. The pricing of options and corporate liabilities (1973)
  4. Option valuation using the fast F ourier transform (1999)
  5. Derivatives in Financial Markets with Stochastic Volatility (2000)
  6. Probability distribution of returns in the H eston model with stochastic volatility (2002)
  7. Full and fast calibration of the H eston stochastic volatility model (2017)
  8. Two singular diffusion problems (1951)
and 11 more
  1. An algorithm for the machine calculation of complex F ourier series (1965)
  2. A closed-form solution for options with stochastic volatility with applications to bond and currency options (1993)
  3. A convolution method for numerical solution of backward stochastic differential equations (2017)
  4. Optimal F ourier Inversion in Semi-Analytical Option Pricing (2006)
  5. Efficient pricing and reliable calibration in the H eston model (2012)
  6. Not-so-complex logarithms in the H eston model (2005)
  7. Complex Logarithms in H eston- L ike models (2010)
  8. Option pricing by transform methods: Extensions, unification and error control (2004)
  9. A fast and accurate FFT -based method for pricing early-exercise options under L 'e vy processes (2008)
  10. Error analysis in F ourier methods for option pricing (2017) — link
  11. F ourier transforms, option pricing and controls (2011)

0 of 19 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.