z-logo
Premium
An efficient graphics processing unit‐based parallel algorithm for pricing multi‐asset American options
Author(s) -
Dang Duy Minh,
Christara Christina C.,
Jackson Kenneth R.
Publication year - 2011
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1784
Subject(s) - computer science , graphics processing unit , graphics , complementarity (molecular biology) , parallel computing , mathematical optimization , linear complementarity problem , valuation of options , algorithm , mathematics , computer graphics (images) , econometrics , biology , genetics , physics , nonlinear system , quantum mechanics
SUMMARY We develop highly efficient parallel PDE‐based pricing methods on graphics processing units (GPUs) for multi‐asset American options. Our pricing approach is built upon a combination of a discrete penalty approach for the linear complementarity problem arising because of the free boundary and a GPU‐based parallel alternating direction implicit approximate factorization technique with finite differences on uniform grids for the solution of the linear algebraic system arising from each penalty iteration. A timestep size selector implemented efficiently on GPUs is used to further increase the efficiency of the methods. We demonstrate the efficiency and accuracy of the parallel numerical methods by pricing American options written on three assets. Copyright © 2011 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here