An Improved Convolution Algorithm for Discretely Sampled Asian Options

Abstract

We suggest an improved FFT pricing algorithm for discretely sampled Asian options with general independently distributed returns in the underlying. Our work complements the studies of Carverhill and Clewlow (1992), Benhamou (2000), and Fusai and Meucci (2008), and, if we restrict our attention only to lognormally distributed returns, also Vecer (2002). While the existing convolution algorithms compute the density of the underlying state variable by moving forward on a suitably defined state space grid our new algorithm uses backward price convolution, which resembles classical lattice pricing algorithms. For the first time in the literature we provide an analytical upper bound for the pricing error caused by the truncation of the state space grid and by the curtailment of the integration range. We highlight the benefits of the new scheme and benchmark its performance against existing finite difference, Monte Carlo, and forward density convolution algorithms.

Keywords: Asian options, Discrete sampling, Convolution, FFT

JEL Classification: G12, G13, C63