A second order L0 stable algorithm for evaluating European options

Ruppa K. Thulasiram, Chen Zhen, Amit Chhabra, Parimala Thulasiraman, Abba B. Gumel

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


In this paper, we study the option pricing problem, one of the prominent and challenging problems in computational finance. Using the Padé 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.

Original languageEnglish (US)
Pages (from-to)311-320
Number of pages10
JournalInternational Journal of High Performance Computing and Networking
Issue number5-6
StatePublished - Jan 1 2006
Externally publishedYes


  • European options
  • Padé approximation
  • finite-differencing
  • parallel computing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'A second order L0 stable algorithm for evaluating European options'. Together they form a unique fingerprint.

Cite this