Abstract
AbstractThe exponential timestepping Euler algorithm with a boundary test is adapted to simulate an expected of a function of exit time, such as the expected payoff of barrier options under the constant elasticity of variance (CEV) model. However, this method suffers from a high Monte Carlo (MC) statistical error due to its exponentially large exit times with unbounded samples. To reduce this kind of error efficiently and to speed up the MC simulation, we combine such an algorithm with an effective variance reduction technique called the control variate method. We call the resulting algorithm the improved Exp algorithm for abbreviation. In regard to the examples we consider in this paper for the restricted CEV process, we found that the variance of the improved Exp algorithm is about six times smaller than that of the Jansons and Lythe original method for the down-and-out call barrier option. It is also about eight times smaller for the up-and-out put barrier option, indicating that the gain in efficiency is significant without significant increase in simulation time.
Publisher
Springer Science and Business Media LLC
Reference33 articles.
1. Alzubaidi, H.: Numerical simulations of the spikng activity and the related first exit time of stochastic nueral systems. Ph.D. thesis, School of Mathematics, University of Manchester (2003)
2. Alzubaidi, H.: Efficient monte carlo algorithm using antithetic variate and brownian bridge techniques for pricing the barrier options with rebate payments. J. Math. Stat. 12(1), 1–11 (2016)
3. Alzubaidi, H.: Random timestepping algorithm with exponential distribution for pricing various structures of one-sided barrier options. Am. J. Comput. Math. 7, 228–242 (2017)
4. Alzubaidi, H.; Shardlow, T.: Improved simulation techniques for first exit time of neural diffusion models. Commun. Stat. Simul. Comput. 43, 2508–2520 (2014)
5. Boyle, P.: Options: a Monte Carlo approach. J. Financial Econ. 4, 323–338 (1977)