A two-grid penalty method for American options
In this paper we consider the pricing of American options, governed by a partial differential complementarity problem. The differential problem is first approximated by a semi-linear PDE using two distinct penalty approaches which are well known in computational finance. We then initiate the two-grid algorithm by solving the nonlinear problem on a coarse grid and further the linearized in the interpolated coarse-grid solution problem on a fine grid. By means of the maximum principle the algorithm is shown to be of fourth order convergence rate in space. Numerical experiments verify the presented two-grid approach where we draw some interesting conclusions.
KeywordsPenalty method Finite difference Two-grid Newton method Maximum principle
Mathematics Subject Classification35R35 65M06
Authors would like to thank the anonymous reviewers for their valuable and constructive comments that greatly contributed to improve the quality of the paper.
- Deng J, Tao Z, Zhang T (2016) Iterative penalty finite element methods for the steady incompressible magnetohydrodynamic problem. Comput Appl Math 1–21. doi: 10.1007/s40314-016-0323-y
- Duffy DJ (2013) Finite difference methods in financial engineering: a partial differential equation approach. Wiley, ChichesterGoogle Scholar
- Koleva M, Valkov R (2016) Two-grid algorithms for pricing American options by a penalty method. Proc Algoritmy 2016:275–284Google Scholar
- Moradipour M, Yousefi SA (2016) Using a meshless kernel-based method to solve the Black–Scholes variational inequality of American options. Comput Appl Math 1–13. doi: 10.1007/s40314-016-0351-7
- Ševčovič D, Stehlıková B, Mikula K (2011) Analytical and numerical methods for pricing financial derivatives. Nova Science Publishers, New YorkGoogle Scholar