Paper: arXiv 2512.24714

Authors: Xiang Gao, Cody Hyndman

Abstract

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 approach. We modify the damping and shifting schemes used in the original formulation, which transforms the target function into a bounded periodic function so that Fourier transforms can be applied successfully. Time-dependent shifting reduces boundary error significantly. We present numerical results for our implementation and provide a detailed error analysis showing the improved accuracy and convergence of the modified convolution method.

Complexity vs Empirical Score

  • Math Complexity: 9.0/10
  • Empirical Rigor: 2.5/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: The paper involves advanced stochastic calculus, partial differential equations, and Fourier analysis with detailed error bounds and convergence proofs. The empirical component is limited to numerical illustrations and theoretical error analysis without real-world data, backtests, or implementation details.

Research Flowchart

  flowchart TD
  A["Research Goal<br>Improve boundary error control in<br>CFFT method for BSDEs"] --> B["Methodology<br>Modify damping & shifting schemes<br>Time-dependent shifting for boundary error"]
  B --> C["Computational Process<br>Implement modified CFFT with<br>numerical experiments"]
  C --> D["Key Findings<br>Significantly reduced boundary errors<br>Faster convergence & higher accuracy<br>Validated with error analysis"]

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 modified convolution‑FFT method that uses exponential damping and a tailored shifting function to reduce boundary errors in BSDE option pricing.

Source sentence
We then propose a method for improving the boundary errors obtained when valuing options using this approach.

Assumes 2

  • The functions η, σ, f, and g are uniformly Lipschitz continuous with bounded first‑order derivatives in the space variables. model
    Source sentence
    The functions η, σ, f, and g are uniformly Lipschitz continuous with bounded first order derivatives in the space variables, for all t ∈[0, T ]: |η(t, u) −η(t, v)| ≤K(|u −v|), …
  • The volatility matrix Σ(t,x)=σ(t,x)σ⊤(t,x) is continuous and L2‑bounded (‖Σ‖2 ≤ C). model
    Source sentence
    The volatility Σ(t, x) = σ(t, x)σ⊤(t, x) is continuous and L2‑bounded ∥Σ∥2 ≤C, for some positive constant C.

Data

  • Synthetic European call option example synthetic unknown
    Source sentence
    We choose that S0 = 100, K = 100, d = 0, r = R = 0.01, µ = 0.05, σ = 0.2, and T = 1.

Costs

Not applicable The paper reports no trading or execution result.

Finds 3

  • Time‑dependent shifting reduces boundary error significantly. theoretical
    Source sentence
    Time‑dependent shifting reduces boundary error significantly.
  • The modified method yields a smooth and accurate delta surface at the boundaries, unlike the original scheme where delta explodes. performance
    Source sentence
    Figure 3 demonstrates that our method displays the entire delta surface which is smooth and very accurate at the boundaries.
  • Numerical results show the proposed method has better accuracy than the original Hyndman and Oyono Ngou (2017) convolution algorithm. performance
    Source sentence
    The numerical result shows that our method has better accuracy than the original method given by Hyndman and Oyono Ngou (2017).

Checked by others

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

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 (17)

  1. Convolution-FFT for option pricing in the Heston model — → 2512.05326
  2. Efficient numerical Fourier methods for coupled forward-backward SDEs (2016) — link
  3. A Fourier Interpolation Method for Numerical Solution of FBSDEs: Global Convergence, Stability, and Higher Order Discretizations (2014) — link
  4. A Convolution Method for Numerical Solution of Backward Stochastic Differential Equations (2013) — link
  5. A forward scheme for backward SDEs (2007) — link
  6. Optimal Fourier Inversion in Semi-Analytical Option Pricing (2007) — link
  7. Forward-Backward Stochastic Differential Equations and their Applications (2007) — link
  8. Rate of convergence of an empirical regression method for solving generalized backward stochastic differential equations (2006) — link
and 9 more
  1. Discrete-time approximation and Monte-Carlo simulation of backward stochastic differential equations (2004) — link
  2. Backward stochastic differential equations and partial differential equations with quadratic growth (2000) — link
  3. Numerical methods for forward-backward stochastic differential equations (1996) — link
  4. Backward-Forward Stochastic Differential Equations (1993) — link
  5. Adapted solution of a backward stochastic differential equation (1990) — link
  6. Stochastic control, numerical methods, and machine learning in finance and insurance (2021)
  7. Discrete-Time Approximation of BSDEs and Probabilistic Schemes for Fully Nonlinear PDEs (2009)
  8. Option valuation using the fast Fourier transform (1999) — link
  9. The Fokker-Planck Equation (2nd ed.) (1996)

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