arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0710.5872math.PRstat.CO
收藏

用线性变换实现拟蒙特卡罗方法模拟

Implementing Quasi-Monte Carlo Simulations with Linear Transformations

Piergiacomo Sabino

摘要:

奇异多资产路径依赖期权的定价需要大量的蒙特卡罗模拟。近年来,人们对拟蒙特卡罗方法重新产生了兴趣,并提出了一些结果,以提高其效率与有效维数的概念。为此,Imai和Tan引入了一种通用方差缩减技术,以最小化蒙特卡罗方法的名义维度。考虑到这些优点,我们详细研究了这种方法,以便从计算的角度来看,使其更快。事实上,我们实现了线性变换分解依赖于一个快速的ad hoc QR分解,大大减少了计算负担。从计算的观点来看,这种设置使得线性变换方法更加方便。本文利用高维(2500)拟蒙特卡罗方法结合线性变换对亚式一篮子期权进行了定价。对于高维随机样本的模拟,我们使用一个50维的乱序Sobol序列的前50个组件,由线性变换方法确定,并填补了其余的拉丁超立方采样。该数值设置的目的是通过仅对由线性变换技术选择的那些分量给出更高的收敛速度来研究估计的准确性。我们还使用标准的Cholesky和主成分分解方法与伪随机和拉丁超立方体采样生成器来启动我们的模拟实验。最后,我们比较我们的结果和计算时间,与那些在今井和谭。

英文摘要:

Pricing exotic multi-asset path-dependent options requires extensive Monte Carlo simulations. In the recent years the interest to the Quasi-monte Carlo technique has been renewed and several results have been proposed in order to improve its efficiency with the notion of effective dimension. To this aim, Imai and Tan introduced a general variance reduction technique in order to minimize the nominal dimension of the Monte Carlo method. Taking into account these advantages, we investigate this approach in detail in order to make it faster from the computational point of view. Indeed, we realize the linear transformation decomposition relying on a fast ad hoc QR decomposition that considerably reduces the computational burden. This setting makes the linear transformation method even more convenient from the computational point of view. We implement a high-dimensional (2500) Quasi-Monte Carlo simulation combined with the linear transformation in order to price Asian basket options with same set of parameters published by Imai and Tan. For the simulation of the high-dimensional random sample, we use a 50-dimensional scrambled Sobol sequence for the first 50 components, determined by the linear transformation method, and pad the remaining ones out by the Latin Hypercube Sampling. The aim of this numerical setting is to investigate the accuracy of the estimation by giving a higher convergence rate only to those components selected by the linear transformation technique. We launch our simulation experiment also using the standard Cholesky and the principal component decomposition methods with pseudo-random and Latin Hypercube sampling generators. Finally, we compare our results and computational times, with those presented in Imai and Tan.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑