arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1012.4976q-fin.CPcs.NAmath.NA
收藏

关于使用策略迭代作为美式期权定价的简单方法

On the Use of Policy Iteration as an Easy Way of Pricing American Options

University of Oxford(牛津大学)

Christoph Reisinger, Jan Hendrik Witte

AI总结:

本文证明策略迭代是求解美式期权有限差分/有限元近似线性互补问题的简单通用算法,其迭代次数上下界为O(N),总复杂度为O(N(M+N)),当M≈N时与欧式期权定价复杂度相同。

摘要:

在本文中,我们证明了策略迭代(由Forsyth & Labahn在2007年HJB方程背景下引入)是一种极其简单的通用算法,用于求解由美式期权的有限差分和有限元近似产生的线性互补问题。我们表明,一般而言,O(N)是求解大小为N的离散LCP所需迭代次数的上界和下界。如果嵌入到具有M个时间步长的标准离散化类中,美式期权定价的整体复杂度实际上仅为O(N(M+N)),因此,当M≈N时,与欧式期权定价的复杂度O(MN)相同。我们还讨论了数值性质以及相对于模型参数(与惩罚和投影松弛方法相比)的鲁棒性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑