On the Use of Policy Iteration as an Easy Way of Pricing American Options
In this paper, we demonstrate that policy iteration, introduced in the context of HJB equations in [Forsyth & Labahn, 2007], is an extremely simple generic algorithm for solving linear complementarity problems resulting from the finite difference and finite element approximation of American options. We show that, in general, O(N) is an upper and lower bound on the number of iterations needed to solve a discrete LCP of size N. If embedded in a class of standard discretisations with M time steps, the overall complexity of American option pricing is indeed only O(N(M+N)), and, therefore, for M N, identical to the pricing of European options, which is O(MN). We also discuss the numerical properties and robustness with respect to model parameters in relation to penalty and projected relaxation methods.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Carl Chiarella & Boda Kang & Gunter H. Meyer & Andrew Ziogas, 2009.
"The Evaluation Of American Option Prices Under Stochastic Volatility And Jump-Diffusion Dynamics Using The Method Of Lines,"
International Journal of Theoretical and Applied Finance (IJTAF),
World Scientific Publishing Co. Pte. Ltd., vol. 12(03), pages 393-425.
- Carl Chiarella & Boda Kang & Gunter H. Meyer & Andrew Ziogas, 2008. "The Evaluation of American Option Prices Under Stochastic Volatility and Jump-Diffusion Dynamics Using the Method of Lines," Research Paper Series 219, Quantitative Finance Research Centre, University of Technology, Sydney.
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1012.4976. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.