arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1706.05935q-fin.CP
收藏

基于傅立叶的定价选择的速度和偏差:一个数值分析

Speed and biases of Fourier-based pricing choices: A numerical analysis

Ricardo Crisóstomo

摘要:

我们比较了七个基于傅立叶的实现的CPU的努力和定价偏差。我们的分析表明,截断和离散误差显着增加,因为我们远离布莱克-斯科尔斯-默顿框架。我们排名的速度和准确性的竞争选择,显示哪些方法需要更小的截断范围,哪些是最有效的采样密度。虽然所有实现都在Bates跳跃扩散模型中收敛良好,但Attari公式是唯一一种不会对任何方差Gamma参数值爆炸的基于傅立叶的方法。在速度方面,使用打击向量计算显著地改善了计算负担,使得快速傅立叶变换(FFT)和普通增量概率分解都是低效的。我们的结论是,COS方法的多罢工版本是明显快于任何其他实现,而罢工优化卡尔马丹的公式是同时更快,更准确的FFT,从而质疑其使用。

英文摘要:

We compare the CPU effort and pricing biases of seven Fourier-based implementations. Our analyses show that truncation and discretization errors significantly increase as we move away from the Black-Scholes-Merton framework. We rank the speed and accuracy of the competing choices, showing which methods require smaller truncation ranges and which are the most efficient in terms of sampling densities. While all implementations converge well in the Bates jump-diffusion model, Attari's formula is the only Fourier-based method that does not blow up for any Variance Gamma parameter values. In terms of speed, the use of strike vector computations significantly improves the computational burden, rendering both fast Fourier transforms (FFT) and plain delta-probability decompositions inefficient. We conclude that the multi-strike version of the COS method is notably faster than any other implementation, whereas the strike-optimized Carr Madan's formula is simultaneously faster and more accurate than the FFT, thus questioning its use.

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

↑