An effective algorithm to solve option pricing problems | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 21، دوره 12، شماره 1، مرداد 2021، صفحه 261-271 اصل مقاله (839.51 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2021.4782 | ||
| نویسنده | ||
| Mojtaba Moradipour* | ||
| Department of Mathematics, Lorestan University, Khorramabad, Iran | ||
| چکیده | ||
| We are aimed to develop a fast and direct algorithm to solve linear complementarity problems (LCP's) arising from option pricing problems. We discretize the free boundary problem of American options in temporal direction and obtain a sequence of linear complementarity problems (LCP's) in the finite dimensional Euclidian space $\mathbb{R}^m$. We develop a fast and direct algorithm based on the active set strategy to solve the LCP's. The active set strategy in general needs $O(2^m m^3)$ operations to solve $m$ dimensional LCP's. Using Thomas algorithm, we develop an algorithm with order of complexity $O(m)$ which can extremely speed up the computations. | ||
| کلیدواژهها | ||
| American options؛ variational inequalities؛ linear complementarity problems | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 16,083 تعداد دریافت فایل اصل مقاله: 10,004 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 726 |
| تعداد مقالات | 10,506 |
| تعداد مشاهده مقاله | 73,611,159 |
| تعداد دریافت فایل اصل مقاله | 65,118,269 |