Processing math: 100%
Go to previous page

Memory-Reduction Method for Pricing American-Style Options under Exponential Lévy Processes

Memory-Reduction Method for Pricing American-Style Options under Exponential Lévy Processes

Year:    2011

East Asian Journal on Applied Mathematics, Vol. 1 (2011), Iss. 1 : pp. 20–34

Abstract

This paper concerns the Monte Carlo method in pricing American-style options under the general class of exponential Lévy models. Traditionally, one must store all the intermediate asset prices so that they can be used for the backward pricing in the least squares algorithm. Therefore the storage requirement grows like O(mn), where m is the number of time steps and n is the number of simulated paths. In this paper, we propose a simulation method where the storage requirement is only O(m+n). The total computational cost is less than twice that of the traditional method. For machines with limited memory, one can now enlarge m and n to improve the accuracy in pricing the options. In numerical experiments, we illustrate the efficiency and accuracy of our method by pricing American options where the log-prices of the underlying assets follow typical Lévy processes such as Brownian motion, lognormal jump-diffusion process, and variance gamma process.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/eajam.020310.120410a

East Asian Journal on Applied Mathematics, Vol. 1 (2011), Iss. 1 : pp. 20–34

Published online:    2011-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    15

Keywords:    American options Monte Carlo simulation memory reduction exponential Lévy processes.

  1. Pricing American options on assets with dividends by a Brownian bridge simulation method

    Proceedings of 2011 International Conference on Computer Science and Network Technology, (2011), P.185

    https://doi.org/10.1109/ICCSNT.2011.6181937 [Citations: 1]
  2. Fast Greeks by simulation: The block adjoint method with memory reduction

    Hu, Wenbin | Li, Shenghong

    Journal of Computational and Applied Mathematics, Vol. 274 (2015), Iss. P.70

    https://doi.org/10.1016/j.cam.2014.07.005 [Citations: 1]
  3. A Probabilistic Numerical Method for Optimal Multiple Switching Problems in High Dimension

    Aïd, René | Campi, Luciano | Langrené, Nicolas | Pham, Huyên

    SIAM Journal on Financial Mathematics, Vol. 5 (2014), Iss. 1 P.191

    https://doi.org/10.1137/120897298 [Citations: 25]
  4. Backward simulation methods for pricing American options under the CIR process

    Hu, Wenbin | Zhou, Junzi

    Quantitative Finance, Vol. 17 (2017), Iss. 11 P.1683

    https://doi.org/10.1080/14697688.2017.1307513 [Citations: 3]
  5. The forward-path method for pricing multi-asset American-style options under general diffusion processes

    Hu, Wenbin | Li, Shenghong

    Journal of Computational and Applied Mathematics, Vol. 263 (2014), Iss. P.25

    https://doi.org/10.1016/j.cam.2013.11.026 [Citations: 3]