On the use of policy iteration as an easy way of pricing American options

From MaRDI portal
Publication:4902222

DOI10.1137/110823328zbMATH Open1257.91051arXiv1012.4976OpenAlexW3103664326MaRDI QIDQ4902222FDOQ4902222


Authors: J. H. Witte, C. Reisinger Edit this on Wikidata


Publication date: 25 January 2013

Published in: SIAM Journal on Financial Mathematics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1012.4976




Recommendations





Cited In (21)





This page was built for publication: On the use of policy iteration as an easy way of pricing American options

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902222)