A second order L0 stable algorithm for evaluating European options
by Ruppa K. Thulasiram, Chen Zhen, Amit Chhabra, Parimala Thulasiraman, Abba B. Gumel
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 4, No. 5/6, 2006

Abstract: In this paper, we study the option pricing problem, one of the prominent and challenging problems in computational finance. Using the Pade approximation, we have developed a second order L0 stable discrete parallel algorithm for experimentation on advanced architectures. We have implemented the sequential version of this algorithm and evaluated the European Options. Numerical results are compared with those obtained using other commonly used numerical methods and shown that the new algorithm is robust and efficient than the traditional schemes. Also, using explicit Forward Time Centered Space (FTCS) on the reduced Black-Scholes partial differerential equation, we report pricing of European options. We have done our experiments on a shared memory multiprocessor machine using OpenMP and report a maximum speedup of 3.43 with 16 threads.

Online publication date: Tue, 01-May-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com