Association Journal of CSIAM
Supervised by Ministry of Education of PRC
Sponsored by Xi'an Jiaotong University
ISSN 1005-3085  CN 61-1269/O1

Chinese Journal of Engineering Mathematics ›› 2021, Vol. 38 ›› Issue (6): 879-900.doi: 10.3969/j.issn.1005-3085.2021.06.010

Previous Articles    

A New Efficient Numerical Method for Pricing American Options on Zero-coupon Bonds

GAN Xiaoting1,   YI Hua2   

  1. 1. School of Mathematics and Computer Science, Chuxiong Normal University, Chuxiong, Yunnan 675000 
    2. Department of Mathematics, Jinggangshan University, Ji'an, Jiangxi 343009
  • Online:2021-12-15 Published:2022-02-15
  • Contact: H. Yi. E-mail address: 876145777@qq.com
  • Supported by:
    The National Natural Science Foundation of China (61463002); the Scientific Research Fund of Yunnan Provincial Education Department (2019J0396); the Scientific Research Foundation of the Education Bureau of Jiangxi Province (GJJ201009); the Special Basic Cooperative Research Programs of Yunnan Provincial Undergraduate Universities' Association (2019FH001-079).

Abstract:

Unlike the European options pricing, the closed-form solution generally does not exist due to the early exercise feature of American options. Hence, numerical approximation methods are normally employed to solve them. Presented in this paper is a new numerical method to price American bond options. To numerically solve the resulting partial differential complementarity problem (PDCP), we develop a class of finite volume method for the spatial discretization, coupled with the stable fully implicit time stepping scheme of the partial differential equation (PDE). Then, the resulting linear complementarity problems (LCPs) are solved by using an efficient iterative method, the modulus-based matrix splitting iteration method, where the $H_{+}$-matrix property of the system matrix guarantees its convergence. Numerical experiments are implemented to verify the accuracy, efficiency and robustness of the new method.

Key words: American bond option, finite volume method, linear complementarity problems, modulus-based matrix splitting iteration method

CLC Number: