Abstract
In this paper, we present a computationally efficient technique based on the Method of Lines for the approximation of the Bermudan option values via the associated partial differential equations. The method of lines converts the Black Scholes partial differential equation to a system of ordinary differential equations. The solution of the system of ordinary differential equations so obtained only requires spatial discretization and avoids discretization in time. Additionally, the exact solution of the ordinary differential equations can be obtained efficiently using the exponential matrix operation, making the method computationally attractive and straightforward to implement. An essential advantage of the proposed approach is that the associated Greeks can be computed with minimal additional computations. We illustrate, through numerical experiments, the efficacy of the proposed method in pricing and computation of the sensitivities for a European call, cash-or-nothing, powered option, and Bermudan put option.
Similar content being viewed by others
Notes
INTERNATIONAL SWAPS AND DERIVATIVES ASSOCIATION: ISDA SIMM TM,1 Methodology, Version 2.0 (December, 2017). https://www.isda.org/a/oFiDE/isda-simm-v2.pdf.
The Python code for all the experiments reported here is available at https://github.com/PurbaBanerjee.
References
Adolfsson, T., Chiarella, C., Ziogas, A., & Ziveyi, J. (2013). Representation and numerical approximation of American option prices under Heston stochastic volatility dynamics. Technical report
Andersson, K., & Oosterlee, C. W. (2021). A deep learning approach for computations of exposure profiles for high-dimensional Bermudan options. Applied Mathematics and Computation, 408, 126332.
Becker, S., Cheridito, P., & Jentzen, A. (2019). Deep optimal stopping. Journal of Machine Learning Research, 20, 74.
Black, F., & Scholes, M. (1973). The valuation of options and corporate liabilities. Journal of Political Economy, 81(3), 637–654.
Brachet, M., Debreu, L., & Eldred, C. (2020). Comparison of exponential integrators and traditional time integration schemes for the Shallow water equations.
Brennan, M. J., & Schwartz, E. S. (1977). The valuation of American put options. The Journal of Finance, 32(2), 449–462.
Broadie, M., & Glasserman, P. (2004). A stochastic mesh method for pricing high-dimensional American options. Journal of Computational Finance, 7, 35–72.
Broadie, M., & Yamamoto, Y. (2003). Application of the fast Gauss transform to option pricing. Management Science, 49(8), 1071–1088.
Buvoli, T., & Minion, M. L. (2022). On the stability of exponential integrators for non-diffusive equations. Journal of Computational and Applied Mathematics, 409, 114126.
Carr, P., & Madan, D. (1999). Option valuation using the fast Fourier transform. Journal of Computational Finance, 2(4), 61–73.
Chiarella, C., Sklibosios Nikitopoulos, C., Schlögl, E., & Yang, H. (2016). Pricing American options under regime switching using method of lines. Available at SSRN 2731087
De Graaf, C. S., Feng, Q., Kandhai, D., & Oosterlee, C. W. (2014). Efficient computation of exposure profiles for counterparty credit risk. International Journal of Theoretical and Applied Finance, 17(04), 1450024.
de Graaf, C., Kandhai, D., & Sloot, P. (2017). Efficient estimation of sensitivities for counterparty credit risk with the finite difference Monte Carlo method. Journal of Computational Finance, 21(1), 83–113.
Fang, F. (2010). The COS method: An efficient Fourier method for pricing financial derivatives.
Fang, F., & Oosterlee, C. W. (2009). A novel pricing method for European options based on Fourier–cosine series expansions. SIAM Journal on Scientific Computing, 31(2), 826–848.
Fazio, R., & Jannelli, A. (2014). Finite difference schemes on quasi-uniform grids for BVPs on infinite intervals. Journal of Computational and Applied Mathematics, 269, 14–23.
Gillespie, R. (1955). Principles of Mathematical Analysis. by Walter Rudin. pp. x, 227. 40s. 1953. (Mcgraw-hill)-theory of functions of real variable. by Henry P. Thielman. pp. xiv, 209. 35s. 1953. (Butterworth scientific publications, London). The Mathematical Gazette, 39(329), 258–259
Haentjens, T., & in’t Hout, K. J. (2015). ADI schemes for pricing American options under the Heston model. Applied Mathematical Finance, 22(3), 207–237.
Hamdi, S., Schiesser, W. E., & Griffiths, G. W. (2007). Method of lines. Scholarpedia, 2(7), 2859.
Haug, E. G. (1997). The Complete Guide to Option Pricing Formulas. McGraw-Hill.
Higham, D. J. (2004). An introduction to financial option valuation: Mathematics, stochastics and computation.
Hochbruck, M., & Ostermann, A. (2010). Exponential integrators. Acta Numerica, 19, 209–286.
Horng, M.-S., Horng, T.-L., & Tien, C.-Y. (2019). A method-of-lines approach for solving American option problems. Taiwanese Journal of Mathematics, 23(5), 1253–1270.
In’t Hout, K., & Foulon, S. (2010). ADI finite difference schemes for option pricing in the Heston model with correlation. International Journal of Numerical Analysis & Modeling, 7(2)
Jain, S., Leitao, Á., & Oosterlee, C. W. (2019). Rolling Adjoints: Fast Greeks along Monte Carlo scenarios for early-exercise options. Journal of Computational Science, 33, 95–112.
Jain, S., & Oosterlee, C. W. (2015). The stochastic grid bundling method: Efficient pricing of Bermudan options and their Greeks. Applied Mathematics and Computation, 269, 412–431.
Jeong, D., Yoo, M., & Kim, J. (2018). Finite difference method for the Black–Scholes equation without boundary conditions. Computational Economics, 51(4), 961–972.
Kang, B., & Meyer, G. H. (2014). Pricing an American call under stochastic volatility and interest rates (pp. 291–314).
Kangro, R., & Nicolaides, R. (2000). Far field boundary conditions for Black–Scholes equations. SIAM Journal on Numerical Analysis, 38(4), 1357–1368.
Lee, H. J., & Schiesser, W. E. (2003). Ordinary and partial differential equation routines in C, C++, Fortran, Java, Maple, and Matlab.
Leitao Rodriguez, A., Oosterlee, C. W., Ortiz-Gracia, L., & Bohte, S. (2017). On the data-driven COS method. Applied Mathematics and Computation, 317, 68–84.
Lokeshwar, V., Bhardawaj, V., & Jain, S. (2021). Neural network for pricing and universal static hedging of contingent claims. Applied Mathematics and Computation.
Longstaff, F. A., & Schwartz, E. S. (2001). Valuing American options by simulation: A simple least-squares approach. The Review of Financial Studies, 14(1), 113–147.
Lord, R., Fang, F., Bervoets, F., & Oosterlee, C. W. (2008). A fast and accurate FFT-based method for pricing early-exercise options under Lévy processes. SIAM Journal on Scientific Computing, 30(4), 1678–1705.
Meyer, G. H. (2014). Time-discrete method of lines for options and bonds, the: A PDE approach (Vol. 1).
Meyer, G. H. (1998). The numerical valuation of options with underlying jumps. Acta Math. Univ. Comenianae, 67(1), 69–82.
Meyer, G. H., & Van der Hoek, J. (1997). The valuation of American options with the method of lines. Advances in Futures and Options Research, 9, 265–286.
Mori, M., & Sugihara, M. (2001). The double-exponential transformation in numerical analysis. Journal of Computational and Applied Mathematics, 127(1–2), 287–296.
Schiesser, W. E., & Griffiths, G. W. (2009). A compendium of partial differential equation models: Method of lines analysis with Matlab.
Strang, G. (2006). Linear algebra and its applications.
Volders, K., et al. (2014). Stability and convergence analysis of discretizations of the Black–Scholes PDE with the linear boundary condition. IMA Journal of Numerical Analysis, 34(1), 296–325.
Yamamoto, Y. (2005). Double-exponential fast Gauss transform algorithms for pricing discrete lookback options. Publications of the Research Institute for Mathematical Sciences, 41(4), 989–1006.
Acknowledgements
This paper is dedicated to the memory of Professor Vasudeva Murthy, who was instrumental in making this work possible.
Funding
No funding was received to assist with the preparation of this manuscript.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
All authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
1.1 Matrix Exponential
The matrix exponential is defined for \(A\in {\mathbb {C}}^{n\times n}\) by,
We shall now state an important theorem which yields the convergence of the matrix Taylor series (28).
Theorem 7.1
(Convergence of matrix Taylor series) Suppose f has a Taylor series expansion,
with radius of convergence r. If \(A\in {\mathbb {C}}^{n \times n}\) then f(A) is defined and is given by
if and only if each of the distinct eigenvalues \(\lambda _1,\ldots ,\lambda _s\) of A satisfies one of the conditions
-
1.
\(|\lambda _i -\alpha |< r,\)
-
2.
\(|\lambda _i -\alpha |=r,\)
and the series for \(f^{(n_i -1)}(\lambda )\) (where \(n_i\) is the index of \(\lambda _i\)) is convergent at the point \(\lambda =\lambda _i\), \(i=1:s\).
Now, if we consider the power series (28), then the corresponding power series is given by,
whose radius of convergence is,
where, \(a_n = \frac{1}{n!}\) (since the limit in the denominator exists in this case). Hence, this readily yields
Therefore, on applying the theorem above we know that the series (28) is defined and further by standard results in analysis (as in Gillespie, 1955), we can differentiate the series term by term to obtain \(\frac{d}{dt}e^{At}=Ae^{At}=e^{At}A.\)
Another representation of a matrix exponential is,
The formula above is the limit of the first-order Taylor expansion of A/s raised to the power of \(s\in {\mathbb {Z}}\). In a more general setting, we can take the limit as \(r\rightarrow \infty \) or \(s\rightarrow \infty \) of r terms of the Taylor expansion of A/s raised to the power of s, thereby generalising both (28) and (32). Results show that this general formula also yields \(e^A\) and provides an error bound for finite r and s. We shall not delve into these details but refer the reader to Gillespie (1955) for a detailed analysis of the same.
1.2 Derivations of the Greeks
Theta (\(\Theta \)): Since the matrices do not involve the parameter t, a direct differentiation of the function \(U(\tau )\) in (15) with respect to t yields the following formula for \(\Theta \),
Vega (\(\nu \)): The calculation of this is a bit involved since the coefficients of the matrices A and F involve the parameter \(\sigma \). We first use the identity \(\zeta {\zeta }^{-1}=I\) and differentiate it partially with respect to \(\sigma \) and utilise the chain rule to obtain,
Now, a simple application of chain rule to (15) , combined with the formula obtained and the straight-forward result \(\frac{\partial \zeta }{\partial \sigma }=A'\) yields the formula (24) for \(\nu \).
Rho (\(\rho \)): An almost identical formulation as that of \(\nu \) yields the following formula,
Using this and the result \(\frac{\partial \zeta }{\partial r}=B'+C'\), one readily obtains the formula (25) for \(\rho \).
1.3 Accuracy and Stability of MOL
It can be seen using a direct application of Taylor’s expansion that \(U(\tau ,x)\) satisfies the following equation,
which gives,
Similarly,
which leads to
Upon adding these two equations, one obtains the expression for \(D^2 U(\tau )\) in (17).
Using these and the fact that \(U(\tau ,x)\) denotes the exact solution of (16), one obtains the local accuracy of the method as follows (Higham, 2004),
which, on application of (17) and (18) becomes,
Since, \(U(\tau ,x)\) is a solution to the Black–Scholes equation (3), the above expression simplifies to,
which gives the desired local accuracy of the method as \({\mathcal {O}}(h^2)\).
Recall that our system of differential equations described in Eq. (20) has a solution given by (15). This implies that the system is stable if \(e^{t\zeta }\) does not blow up. To ensure this, it is enough if the real part of each of the Eigen values of the associated matrix \(\zeta \) are negative, since F is a constant matrix in our case (Strang, 2006).
For general cases, though, F is not necessarily constant and is itself a function of time. In such a case, one could use the scheme discussed in Hochbruck and Ostermann (2010).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Banerjee, P., Murthy, V. & Jain, S. Method of Lines for Valuation and Sensitivities of Bermudan Options. Comput Econ 63, 245–270 (2024). https://doi.org/10.1007/s10614-022-10339-2
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10614-022-10339-2