Fast fourier transform for option pricing: improved mathematical modeling and design of an efficient parallel algorithm
| dc.contributor.author | Barua, Sajib | |
| dc.contributor.examiningcommittee | Dr. Peter Graham (Computer Science), Dr. Abba Gumel (Mathematics) | en |
| dc.contributor.supervisor | Dr. Ruppa K. Thulasiram (Computer Science) | en |
| dc.date.accessioned | 2005-05-19T14:07:36Z | |
| dc.date.available | 2005-05-19T14:07:36Z | |
| dc.date.issued | 2005-05-19T14:07:36Z | |
| dc.degree.discipline | Computer Science | en_US |
| dc.degree.level | Master of Science (M.Sc.) | en_US |
| dc.description.abstract | The Fast Fourier Transform (FFT) has been used in many scientific and engineering applications. The use of FFT for financial derivatives has been gaining momentum in the recent past. In this thesis, i) we have improved a recently proposed model of FFT for pricing financial derivatives to help design an efficient parallel algorithm. The improved mathematical model put forth in our research bridges a gap between quantitative approaches for the option pricing problem and practical implementation of such approaches on modern computer architectures. The thesis goes further by proving that the improved model of fast Fourier transform for option pricing produces accurate option values. ii) We have developed a parallel algorithm for the FFT using the classical Cooley-Tukey algorithm and improved this algorithm by introducing a data swapping technique that brings data closer to the respective processors and hence reduces the communication overhead to a large extent leading to better performance of the parallel algorithm. We have tested the new algorithm on a 20 node SunFire 6800 high performance computing system and compared the new algorithm with the traditional Cooley-Tukey algorithm. Option values are calculated 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 stock price. Compared to the traditional Cooley-Tukey algorithm, the current algorithm with data swapping performs better by more than 15% for large data sizes. In the rapidly changing market place, these improvements could mean a lot for an investor or financial institution because obtaining faster results offers a competitive advantages. | en |
| dc.description.note | October 2004 | en |
| dc.format.extent | 620751 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1993/120 | |
| dc.language.iso | eng | en_US |
| dc.rights | open access | en_US |
| dc.subject | Option Pricing | en |
| dc.subject | Parallel Fast Fourier Transform Algorithm | en |
| dc.subject | Financial Derivatives | en |
| dc.subject | Data Locality | en |
| dc.title | Fast fourier transform for option pricing: improved mathematical modeling and design of an efficient parallel algorithm | en |
| dc.type | master thesis | en_US |