GPGPUs in computational finance: massive parallel computing for American style options
- 6 July 2011
- journal article
- research article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 24 (8) , 837-848
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- WHEN ARE SWING OPTIONS BANG-BANG?International Journal of Theoretical and Applied Finance, 2010
- How to speed up the quantization tree algorithm with an application to swing optionsQuantitative Finance, 2010
- Optimal Quantization for the Pricing of Swing OptionsApplied Mathematical Finance, 2009
- A QUANTIZATION TREE METHOD FOR PRICING AND HEDGING MULTIDIMENSIONAL AMERICAN OPTIONSMathematical Finance, 2005
- A quantization algorithm for solving multidimensional discrete-time optimal stopping problemsBernoulli, 2003
- Regression methods for pricing complex American-style optionsIEEE Transactions on Neural Networks, 2001
- Valuing American Options by Simulation: A Simple Least-Squares ApproachThe Review of Financial Studies, 2001
- Foundations of Quantization for Probability Distributions2000
- Valuation of the early-exercise price for options using simulations and nonparametric regressionInsurance: Mathematics and Economics, 1996
- Applications of martingale system theoremsTransactions of the American Mathematical Society, 1952