High Performance Computing for a Financial Application Using Fast Fourier Transform

Abstract Fast Fourier Transform (FFT) has been used in many scientific and engineering applications. In the current study, we have applied the FFT for a novel application in finance. We have improved a mathematical model of Fourier transform technique for pricing financial derivatives to help design an effective parallel algorithm. We have then developed a new parallel algorithm for FFT using a swapping technique that exploits data locality. We have analyzed our algorithm theoretically and have reported the significance of the new algorithm. We have implemented our algorithm on 20 node SunFire 6800 high performance computing system and compared the new algorithm with the traditional Cooley-Tukey algorithm both as stand alone comparison of the performance and in relation to our theoretical analysis and showed higher efficiency of our algorithm. We have presented the computed option values for various strike prices with a proper selection of strike-price spacing to ensure fine-grid integration for FFT computation as well as to maximize the number of strikes lying in the desired region of the asset price.

[1]  Aleš Černý,et al.  Introduction to Fast Fourier Transform in Finance , 2004 .

[2]  Ruppa K. Thulasiram,et al.  Performance Evaluation of a Multithreaded Fast Fourier Transform Algorithm for Derivative Pricing , 2003, The Journal of Supercomputing.

[3]  Stavros A. Zenios,et al.  High-performance computing in finance: The last 10 years and the next , 1999, Parallel Comput..

[4]  J. Hull Options, Futures, and Other Derivatives , 1989 .

[5]  P. Carr,et al.  Option valuation using the fast Fourier transform , 1999 .

[6]  C. Loan Computational Frameworks for the Fast Fourier Transform , 1992 .

[7]  Curt Randall,et al.  Pricing Financial Instruments: The Finite Difference Method , 2000 .

[8]  Berç Rustem,et al.  Parallel computing in economics, finance and decision-making , 2000, Parallel Comput..

[9]  P. Boyle Options: A Monte Carlo approach , 1977 .

[10]  S. Ross,et al.  Option pricing: A simplified approach☆ , 1979 .

[11]  David H. Bailey,et al.  FFTs in external or hierarchical memory , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[12]  P. Wilmott,et al.  The Mathematics of Financial Derivatives: Contents , 1995 .

[13]  Guang R. Gao,et al.  Multithreaded algorithms for pricing a class of complex options , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[14]  F. Black,et al.  The Pricing of Options and Corporate Liabilities , 1973, Journal of Political Economy.

[15]  D. Duffie Dynamic Asset Pricing Theory , 1992 .

[16]  M.B. Haugh,et al.  Computational challenges in portfolio management , 2001, Comput. Sci. Eng..

[17]  M. Dempster,et al.  Spread Option Valuation and the Fast Fourier Transform , 2002 .