Research Article | Open Access

Volume 2019 |Article ID 1753782 | https://doi.org/10.1155/2019/1753782

Zhongdi Cen, Anbo Le, Aimin Xu, "A Robust Spline Collocation Method for Pricing American Put Options", Discrete Dynamics in Nature and Society, vol. 2019, Article ID 1753782, 11 pages, 2019. https://doi.org/10.1155/2019/1753782

# A Robust Spline Collocation Method for Pricing American Put Options

Revised27 Mar 2019
Accepted18 Apr 2019
Published02 May 2019

#### Abstract

In this paper a robust numerical method is proposed for pricing American put options. The Black-Scholes differential operator in the original form is discretized by using a quadratic spline collocation method on a piecewise uniform mesh for the spatial discretization and the implicit Euler scheme for the time discretization. The position of collocation points is chosen so that the spline difference operator satisfies the discrete maximum principle, which guarantees that the scheme is maximum-norm stable. The error estimation is derived by applying the maximum principle to the discrete linear complementarity problem in two mesh sets. It is proved that the scheme is second-order convergent with respect to the spatial variable and first-order convergent with respect to the time variable. Numerical results demonstrate that the scheme is stable and accurate.

#### 1. Introduction

The American option is an important financial instrument that gives the holder the right, but not obligation, to buy (call option) or sell (put option) an asset at any time prior to its maturity date. One way to price American options is to solve a linear complementarity problem involving the Black-Scholes differential operator [1]. Since this complementarity problem is, in general, not analytically solvable, numerical methods are required to obtain the approximate solution.

The spline approximation methods have become interesting and very promising in solving differential equations due to their flexibility in practical applications. The spline solution has its own advantages, for example, once the solution has been computed, the information required for the spline interpolation between mesh points is easy to obtain. A few papers have used the spline approximation methods to solve option pricing problems. Khabir and Patidar [2] applied a B-spline collocation method to solve the heat equation which is obtained from the Black-Scholes equation by an Euler transformation. Kadalbajoo et al. [3, 4] used cubic B-spline collocation methods for the Euler transformed generalized Black-Scholes equation. Mohammadi [5] developed a quintic B-spline collocation method for solving the generalized Black-Scholes equation governing option pricing. Christara and Leung [6] derived a quadratic spline collocation method on a uniform mesh in the pricing problem under a finite activity jump-diffusion model. Rashidinia and Jamalzadeh [7] proposed a modified B-spline collocation approach for pricing American style Asian options.

In this paper we adopt a quadratic spline collocation method on a piecewise uniform mesh to solve the continuous linear complementarity problem arising from American put option pricing. The Black-Scholes differential operator in the original form is discretized. By applying the technique of Surla et al. [8, 9], the position of collocation points is chosen so that the spline difference operator on a piecewise uniform mesh satisfies the discrete maximum principle, which guarantees that the discretization scheme is maximum-norm stable. The error estimation is derived by applying the maximum principle to the discrete linear complementarity problem in two mesh sets. It is proved that the convergence order of the scheme is second-order with respect to the spatial variable and first-order with respect to the time variable. The scheme examined in the present paper overcomes the difficulty in the derivation of the error estimation for the linear complementarity problem under the difference schemes. Numerical results are presented to support these theoretical results.

The outline of the paper is as follows. In Section 2 the continuous linear complementarity problem for pricing American put options is given. In Section 3 the spline difference scheme is derived. In Section 4 the stability and error analysis for the spline difference scheme are proved. In Section 5 numerical experiments are carried out. Finally conclusion and discussion are indicated in Section 6.

#### 2. The Continuous Problem

It is well known that the value of an American put option satisfies the following continuous linear complementarity problem [1, 10]: where represents the Black-Scholes differential operator defined by is the underlying asset price, is the time, is the volatility of the underlying asset price, is the risk-free interest rate, is the continuous dividend rate, is the strike price, is the maturity date, and is the payoff function given by Here we assume that .

The infinite domain needs to be truncated into a bounded domain for solving the problem by the numerical method, where is taken as based on Willmott et al.’s estimate [1]. The boundary condition at is set to be . A detailed discussion of the choice of the linear boundary conditions can be found in [11]. Normally, the error in the computed option price due to the domain truncation is negligible [12]. Therefore, in the remaining of this paper we will focus on solving the following linear complementarity problem

#### 3. Discretization

Since the Black-Scholes differential operator at is degenerative, the Euler transformation is usually used to remove the singularity of the differential operator at (corresponding to in the transformed domain); see, e.g., Schwartz [13], Tangman et al. [14], and Zhao et al. [15]. However, this will result in additional computational errors due to the truncation on the left-hand side of the domain. Furthermore, the originally mesh points will concentrate around inappropriately by using the uniform mesh on the transformed interval. In this paper we will discretize the Black-Scholes equation in the original form, but with a quadratic spline collocation method for the spatial discretization and the implicit Euler scheme for the temporal discretization. It should be remarked that if the commonly quadratic spline collocation method is adopted on a uniform mesh for the original Black-Scholes equation, the stability of the scheme could not be guaranteed. The analogous problems have been discussed in [16, 17].

For the spatial discretization, a piecewise uniform mesh is constructed to guarantee the stability of the discretization scheme:whereFor the temporal discretization, a uniform mesh on with mesh elements is used. Then the domain is divided into the piecewise uniform mesh . The mesh sizes and , respectively, satisfyand It will be shown that the matrix associated with the spline difference operator on the above piecewise uniform mesh is an M-matrix.

The implicit Euler scheme on is used for the time discretization to get the following linear complementarity problem: where and denotes the approximation of the exact solution at -th time level.

The solution of the problem (18)-(22) is approximated by a quadratic spline function which on each subinterval has the following form:The collocation points are chosen in a nonstandard way as that in [8, 9]: for , where . Then the collocation equations are defined by

We can obtain , from the quadratic spline function (24). Since , , we have Substituting the above expressions for , and into (27) on the interval with we havewhereUsing the same technique on the interval with the collocation equation (26) and replacing by in (31), we also can obtainwhere Combining (30) with (33), we have the following spline difference schemewhere Two degrees of freedom are provided by parameters and , which can be used to guarantee that the matrix associated with the discrete operator is an M-matrix. Here we choose and for . In the next section we will prove that and .

Combining (18)-(22) with (35) we can obtain the following fully discretization schemewhereHere we have used the linear interpolation to get the approximated solutions at mesh points and since we only know the numerical solution on mesh points at -th time level.

There exists a unique solution for the above linear complementarity problem (37)-(41). A detailed discussion of existence and uniqueness of the solution for problem (37)-(41) can be found in [18]. Then from the above solution we can obtain the optimal stopping price which is the maximum asset price such that for each .

Remark 1. In general the points are used as the collocation points [19, 20], i.e., . But for the problem (18)-(22) the discrete operator with does not satisfy the discrete maximum principle. Hence, in order to apply the discrete maximum principle and barrier function technique to analyze the stability and error estimate we use collocation points on and on for .

#### 4. Analysis of the Method

The discrete maximum principle, truncation error analysis techniques, and barrier function techniques are used for analysis of the scheme.

Lemma 2 (discrete maximum principle). When and for , the operator on satisfies a discrete maximum principle; i.e., if is a mesh function satisfying , , and , , then for all .

Proof. When and , it is easy to check that for sufficiently small and . We also have Hence we can conclude that and for and . Hence the matrix associated with is an M-matrix, which reveals that the operator satisfies the discrete maximum principle [21].

By using Taylor expansions we can get the following bound of the truncation error where and Thus, when and for , from (47) we havewhere is a positive constant independent of the mesh.

The following theorem is our main result for the quadratic spline collocation scheme.

Theorem 3. Let be the solution of problem (9)-(13) and the solution of problem (37)-(41). Then if we set and for , there exists a positive constant independent of the mesh such that

Proof. The error estimate will be derived by applying the maximum principle to the discrete linear complementarity problem in two mesh sets as that in [22]. Set From (9)-(13) we have Let It is easy to check that Define the barrier functionwhere is a sufficiently large constant independent of and .
For we have by using and (49), (54), and (55). On the “boundary” of the we have and Then we have by using the maximum principle (Lemma 2) to . Hence, we haveFor , but ; thus for the sufficiently large constant we have where we have used and (49). On the “boundary” of the we have and Then we have by using the maximum principle (Lemma 2) to . HenceCombining (60) with (65) we have which completes the proof.

#### 5. Numerical Experiments

In this section we perform the numerical experiments to illustrate the applicability and accuracy of the method obtained in the preceding section. Errors and convergence rates for the spline difference scheme are presented for two examples.

Example 1. Compute the value of an American put option with , and .

Example 2. Compute the value of an American put option with , and .

The projection scheme [23] is used to solve the linear inequality system (37)-(41). Assume that are known; then we first solve the following discretization problem for : Next we set which ensure that (38) and (39) are satisfied.

The computed option values and the constraints with and are plotted in Figures 14 for Examples 1 and 2, respectively.

Since the exact solutions of our examples are not available, the quadratic spline approximated solution of is used as the exact solution denoted by . The error estimates for different at are presented. The accuracy in the discrete maximum-norm, and the convergence rate are computed. The error estimates and convergence rates for Examples 1 and 2 are listed in Tables 1 and 2, respectively.

 K N error rate 1024 128 2.3532e-2 2.009 256 5.8452e-3 1.914 512 1.5506e-3 2.342 1024 3.0592e-4 -
 K N error rate 1024 128 8.6028e-3 2.031 256 2.1045e-3 2.097 512 4.9176e-4 2.451 1024 8.9918e-5 -

From Figures 1 and 3 we can conclude that the numerical solutions are nonoscillatory, and from Figures 2 and 4 we also can conclude that the numerical solutions satisfy the constraint conditions (38) and (39). Tables 1 and 2 show that is close to 2 for sufficiently large . These results support the convergence estimate of Theorem 3.

Finally, our scheme is compared with the binomial method, analytic approximation method, and compact finite difference methods. The numerical example and numerical results in Zhao [15] are used. The parameters for the American put option are , and . The results for the binomial method are obtained with the time mesh size . The results for the analytical approximation method are obtained with the time mesh size . The results for the compact finite difference methods 1, 2, and 3 are obtained with the spatial mesh size and the time mesh size . For our spline collocation scheme we use the time mesh size and mesh points for the spatial discretization which has almost same number of mesh points as that of the compact methods. The true option values are obtained with the trinomial method using the time mesh size . Table 3 shows that our scheme is more accurate than other methods.

 Stock price Binomial method Analytic approx. method Compact method 1 Compact method 2 Compact method 3 Our stable scheme True values 75.9572 25.33949 25.4509 25.10042 25.32570 25.32739 25.32892 25.32986 error 0.00963 0.12104 0.22944 0.00416 0.00247 0.00094 83.9457 19.49101 19.6617 19.34597 19.49193 19.49383 19.49565 19.49691 error 0.00590 0.16479 0.15094 0.00498 0.00308 0.00126 92.7743 14.27957 14.4477 14.16375 14.25707 14.25914 14.26121 14.26265 error 0.01692 0.18505 0.09890 0.00558 0.00351 0.00144 102.5315 9.87092 10.0278 9.78167 9.83789 9.84000 9.84216 9.84354 error 0.02738 0.18426 0.06187 0.00565 0.00354 0.00138 113.3148 6.35580 6.53401 6.32881 6.36044 6.36241 6.36458 6.36558 error 0.00978 0.16843 0.03677 0.00514 0.00317 0.00100 125.2323 3.84473 3.97728 3.81244 3.82898 3.83064 3.83268 3.83337 error 0.01136 0.14391 0.02093 0.00439 0.00273 0.00069 138.4031 2.14801 2.25467 2.12653 2.13452 2.13578 2.13757 2.13784 error 0.01017 0.11683 0.01131 0.00332 0.00206 0.00027

As discussed above, the optimal stopping boundary can be obtained as the maximum asset price such that for each . We plot the optimal stopping boundary for the two examples with in Figures 5 and 6, respectively.

#### 6. Conclusion and Discussion

In this paper the linear complementarity problem arising from American put option pricing is treated by a quadratic spline collocation method on a piecewise uniform mesh. The main advantage of the spline collocation method examined in the present paper lies in the possibility of simple and direct constructing of a continuous approximate solution and normalized flux between the mesh points. The suitable choice of collocation points guarantees that the spline difference operator on the piecewise uniform mesh satisfies the discrete maximum principle. Hence the scheme is maximum-norm stable. The error estimation is derived by applying the maximum principle to the discrete linear complementarity problem in two mesh sets. It is proved that the scheme is second-order convergent with respect to the spatial variable and first-order convergent with respect to the time variable. Numerical results demonstrate that the scheme is stable and accurate.

For the time discretization, although the Crank-Nicolson scheme can be used to improve the truncation error scheme, the discretization scheme does not satisfy the maximum principle without additional constraints about the time sizes, which leads to the difficulty in the derivation of the error estimation for the linear complementarity problem under the difference schemes. In future we plan to overcome this difficulty in the error analysis for the Crank-Nicolson scheme in discretizing the linear complementarity problem.

Since the probability distribution of realized asset returns may exhibit features such as heavy tails, volatility clustering, and volatility smile, two different classes of models have been studied in the finance literature: the jump-diffusion models [24, 25] and the stochastic volatility models [26, 27]. In future we extend this technique to construct spline collocation schemes and study the stability and error analysis of these schemes for the jump-diffusion models and the stochastic volatility models.

#### Data Availability

The data used to support the findings of this study are included within the article.

#### Conflicts of Interest

The authors declare that they have no conflicts of interest.

#### Acknowledgments

The work was supported by Major Humanities and Social Sciences Projects in Colleges and Universities of Zhejiang Province of China (Grant no. 2018GH020).

#### References

1. P. Wilmott, J. Dewynne, and S. Howison, Option Pricing: Mathematical Models and Computation, Oxford Financial Press, Oxford, 1993.
2. M. H. Khabir and K. C. Patidar, “Spline approximation method to solve an option pricing problem,” Journal of Difference Equations and Applications, vol. 18, no. 11, pp. 1801–1816, 2012. View at: Publisher Site | Google Scholar | MathSciNet
3. M. K. Kadalbajoo, L. P. Tripathi, and P. Arora, “A robust nonuniform B-spline collocation method for solving the generalized BLAck-Scholes equation,” IMA Journal of Numerical Analysis (IMAJNA), vol. 34, no. 1, pp. 252–278, 2014. View at: Publisher Site | Google Scholar | MathSciNet
4. M. K. Kadalbajoo, L. P. Tripathi, and A. Kumar, “A cubic B-spline collocation method for a numerical solution of the generalized BLAck-Scholes equation,” Mathematical and Computer Modelling, vol. 55, no. 3-4, pp. 1483–1505, 2012. View at: Publisher Site | Google Scholar | MathSciNet
5. R. Mohammadi, “Quintic B-spline collocation approach for solving generalized BLAck-Scholes equation governing option pricing,” Computers & Mathematics with Applications. An International Journal, vol. 69, no. 8, pp. 777–797, 2015. View at: Publisher Site | Google Scholar | MathSciNet
6. C. C. Christara and N. C. Leung, “Option pricing in jump diffusion models with quadratic spline collocation,” Applied Mathematics and Computation, vol. 279, pp. 28–42, 2016. View at: Publisher Site | Google Scholar | MathSciNet
7. J. Rashidinia and S. Jamalzadeh, “Modified B-spline collocation approach for pricing American style ASIan options,” Mediterranean Journal of Mathematics, vol. 14, no. 3, Art. 111, 17 pages, 2017. View at: Publisher Site | Google Scholar | MathSciNet
8. K. Surla, L. Teofanov, and Z. Uzelac, “A robust layer-resolving spline collocation method for a convection-diffusion problem,” Applied Mathematics and Computation, vol. 208, no. 1, pp. 76–89, 2009. View at: Publisher Site | Google Scholar | MathSciNet
9. K. Surla, Z. Uzelac, and L. Teofanov, “The discrete minimum principle for quadratic spline discretization of a singularly perturbed problem,” Mathematics and Computers in Simulation, vol. 79, no. 8, pp. 2490–2505, 2009. View at: Publisher Site | Google Scholar | MathSciNet
10. J. Huang and J. Pang, “Option pricing and linear complementarity,” The Journal of Computational Finance, vol. 2, no. 1, pp. 31–60, 1998. View at: Publisher Site | Google Scholar
11. D. Jeong, S. Seo, H. Hwang, D. Lee, Y. Choi, and J. Kim, “Accuracy, robustness, and efficiency of the linear boundary condition for the Black-Scholes equations,” Discrete Dynamics in Nature and Society, vol. 2015, Article ID 359028, 10 pages, 2015. View at: Publisher Site | Google Scholar | MathSciNet
12. R. Kangro and R. Nicolaides, “Far field boundary conditions for Black-Scholes equations,” SIAM Journal on Numerical Analysis, vol. 38, no. 4, pp. 1357–1368, 2000. View at: Publisher Site | Google Scholar | MathSciNet
13. E. S. Schwartz, “The valuation of warrants: Implementing a new approach,” Journal of Financial Economics, vol. 4, no. 1, pp. 79–93, 1977. View at: Publisher Site | Google Scholar
14. D. Y. Tangman, A. Gopaul, and M. Bhuruth, “Numerical pricing of options using high-order compact finite difference schemes,” Journal of Computational and Applied Mathematics, vol. 218, no. 2, pp. 270–280, 2008. View at: Publisher Site | Google Scholar | MathSciNet
15. J. Zhao, M. Davison, and R. M. Corless, “Compact finite difference method for American option pricing,” Journal of Computational and Applied Mathematics, vol. 206, no. 1, pp. 306–321, 2007. View at: Publisher Site | Google Scholar | MathSciNet
16. Z. Cen and A. Le, “A robust and accurate finite difference method for a generalized Black-Scholes equation,” Journal of Computational and Applied Mathematics, vol. 235, no. 13, pp. 3728–2733, 2011. View at: Publisher Site | Google Scholar | MathSciNet
17. D. Jeong, M. Yoo, and J. Kim, “Accurate and efficient computations of the Greeks for options near expiry using the Black-Scholes equations,” Discrete Dynamics in Nature and Society, vol. 2016, Article ID 1586786, 12 pages, 2016. View at: Publisher Site | Google Scholar | MathSciNet
18. D. Goeleven, “A uniqueness theorem for the generalized-order linear complementary problem associated with M-matrices,” Linear Algebra and its Applications, vol. 235, pp. 221–227, 1996. View at: Publisher Site | Google Scholar | MathSciNet
19. K. Surla and Z. Uzelac, “A uniformly accurate spline collocation method for a normalized flux,” Journal of Computational and Applied Mathematics, vol. 166, no. 1, pp. 291–305, 2004. View at: Publisher Site | Google Scholar | MathSciNet
20. L. Teofanov and Z. Uzelac, “Family of quadratic spline difference schemes for a convection-diffusion problem,” International Journal of Computer Mathematics, vol. 84, no. 1, pp. 33–50, 2007. View at: Publisher Site | Google Scholar | MathSciNet
21. R. B. Kellogg and A. Tsan, “Analysis of some difference approximations for a singular perturbation problem without turning points,” Mathematics of Computation, vol. 32, no. 144, pp. 1025–1039, 1978. View at: Publisher Site | Google Scholar | MathSciNet
22. X.-l. Cheng and L. Xue, “On the error estimate of finite difference method for the obstacle problem,” Applied Mathematics and Computation, vol. 183, no. 1, pp. 416–422, 2006. View at: Publisher Site | Google Scholar | MathSciNet
23. R. Glowinski, J. L. Lions, and R. Tremolieres, Numerical Analysis of Variational Inequalities, North-Holland, Amsterdam, The Netherlands, 1981. View at: MathSciNet
24. L. Feng and V. Linetsky, “Pricing options in jump-diffusion models: an extrapolation approach,” Operations Research, vol. 56, no. 2, pp. 304–325, 2008. View at: Publisher Site | Google Scholar | MathSciNet
25. G. Tour and D. Y. Tangman, “Cubic B-spline collocation method for pricing path dependent options,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 8584, no. 6, pp. 372–385, 2014. View at: Google Scholar
26. B. Düring, M. Fournié, and C. Heuer, “High-order compact finite difference schemes for option pricing in stochastic volatility models on non-uniform grids,” Journal of Computational and Applied Mathematics, vol. 271, pp. 247–266, 2014. View at: Publisher Site | Google Scholar | MathSciNet
27. C. Guardasoni and S. Sanfelici, “Fast numerical pricing of barrier options under stochastic volatility and jumps,” SIAM Journal on Applied Mathematics, vol. 76, no. 1, pp. 27–57, 2016. View at: Publisher Site | Google Scholar | MathSciNet

Copyright © 2019 Zhongdi Cen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.