An Analytically Modified Finite Difference Scheme for Pricing Discretely Monitored Options
Abstract
:1. Introduction
1.1. Brief Review of Products Considered
1.2. Organization of the Paper
2. Materials and Methods
2.1. Basic Assumptions
- (A)
- The option to be priced has two strike prices , with , at each observation date . The expiration date is .
- (B)
- The option is exercised if or at some , and the payoffs are given by (if ) and (if ), respectively, for some .
- (C)
- The final payoff at maturity is
- There are finitely many observation points, and two exercise levels (possibly ∞) at each observation point. If S is above the upper exercise level or below the lower exercise level at any observation point, the option is exercised and the payoff is a linear function in S.
- At maturity, if S is between the two exercise levels, a payoff is incurred which is also a linear function in S.
- The underlying asset price S follows a geometric Brownian motion with possibly time-dependent interest rates, yield rates, and volatilities.
2.2. Finite Difference Methods
2.3. Analytical Modification
- 1.
- If the option has payoff , then .
- 2.
- If , then .
- 3.
- If , then .
- 4.
- If , then .
2.3.1. Basic Idea of the Analytical Modification
2.3.2. Implementation of the Analytical Modification
Algorithm 1 Modified finite difference method |
|
2.4. Adaptive Mesh Refinement
Algorithm 2 Adaptive mesh refinement procedure |
|
3. Results
3.1. Convergence Study
- Option I: A cash-or-nothing call option with the following final payoff:
- Option II: An asset-or-nothing call option with the following final payoff:
- Option III: A vanilla call option with the following final payoff:
- Option IV: An exotic call option with the following final payoff:We remark that this option does not have a counterpart in real-life financial applications. It is designed here solely to test the convergence properties of the proposed method.
- Option V: A double-barrier knock-out option with different monitoring frequencies for the two barriers. Assume there are 250 business days in a year, and the option will expire one year from the valuation date, which we denote as day 0. The spot price of the underlying asset at day 0 is 1.1. The upper barrier level is 1.2, and its observation dates are {15, 36, 57, 78, 99, 120, 141, 162, 183, 204, 225, 246}, resembling a monthly monitoring structure. The lower barrier is monitored daily, and the barrier level is 0.9. We further assume that the notional value of the option is 100, that the payoff at maturity is 10% of the notional value, namely, 10, and that
- For the first two options (I–II), the C-N method converges at only the first order due to the discontinuity at contained in the terminal conditions. On the other hand, mesh adaptation around the discontinuity , where option prices are expected to undergo the most rapid variation, helps reduce the error by a factor of n where here is the refinement factor.
- For the next two options (III–IV), the C-N method converges at a higher order due to the improved smoothness of the terminal condition at . The precise relationship between the convergence rate and the smoothness of the terminal condition is the subject of future research, but these examples seem to suggest that a terminal condition is already sufficient to restore the second-order accuracy of the C-N method (see Remark 5).
- When mesh adaptation is applied to the third option, the error first improves by roughly a factor of up until , after which no significant improvement in error is observed (Table 6). This is due to the fact that the terminal condition in this case has a higher degree of smoothness at (i.e., ), as a result of which the largest error on a sufficiently fine grid does not concentrate around , and hence is not captured by the adaptive mesh that surrounds the strike price . Similar observations apply to the fourth option, whose terminal condition has an even higher degree of smoothness at (i.e., ) and for which no improvement in error is observed for the adaptive mesh calculation at all.
- Despite these observations, the mesh adaptation technique still turns out to be useful when applied to discretely monitored options with high monitoring frequencies, where errors near the barriers caused by the non-smoothness of the terminal conditions dominate the calculations (Section 3.1 and Section 3.3).
- For the original C-N method, the numerical approximations converge to the reference values in at an average rate of roughly one but do not converge in at all (Table 9). This reduced convergence rate or even lack of convergence is clearly a consequence of the discontinuities at the barriers contained in the terminal conditions. On the other hand, mesh adaptation around the barriers, where option prices are expected to undergo the most rapid variation, helps reduce the error by a factor of n where here is the refinement factor (Table 10).
- For the analytically modified C-N method, with either or modifications, the numerical approximations converge to the reference values in both and and do so at a higher rate due to the improved smoothness of the terminal conditions at the barriers. More specifically, with modifications, converge to in at an average rate of roughly three-halves and in at an average rate of roughly one (Table 11), while with -modifications, the convergence in both and has an average rate of roughly two (Table 13). In other words, these examples seem to suggest that a modification to the terminal conditions is already sufficient to restore the second-order accuracy of the C-N method.
- When mesh adaptation is applied with modifications, both the - and -errors improve by roughly a factor of for all , demonstrating the effectiveness of the adaptive mesh (Table 12).
- When mesh adaptation is applied with modifications, the numerical approximations calculated on the finest grid with are almost identical with the reference values calculated on the uniform fine grid with , as suggested by the unusually small errors (last row, Table 14). On the other hand, for numerical approximations calculated on coarser grids with , both the - and -errors improve by roughly a factor of for all when mesh adaptation is enabled. This provides additional strong evidence for the effectiveness of the adaptive mesh, especially on discretely monitored options with high monitoring frequencies.
- We remark that for mesh adaptation applied with modifications, a sufficiently large area around the barriers needs to be refined in order for the adaptive mesh to be effective, in view of the improved smoothness of the terminal conditions near the barriers. Indeed, when the refinement ratio in Table 14 was reduced from 15% to 10%, meaning only the grid points around each barrier are refined, the resulting adaptive mesh was only able to produce marginal improvement in error for and was not able to produce any meaningful improvement in error at all for all larger . This is not an issue when mesh adaptation is applied with modifications or with no analytical modifications, where the errors near the barriers caused by the non-smoothness of the terminal conditions dominate the calculations.
3.2. Comparison with Other Numerical Methods
- Both methods exhibit very similar convergence behaviors and converge in both and at an average rate of roughly one. This shows, in particular, that both methods lose their second-order accuracy when applied to problems containing discontinuities.
- Analytically modified C-N with modification (CN-C1).
- C-N with Rannacher time-stepping (CN-RAN).
- Trapezoidal rule with second-order backward differentiation formula (TR-BDF2).
- Forward-time centered-space (or implicit Euler) (FTCS).
- Monte Carlo simulations (MC).
- 16.7132 s (CN-RAN);
- 36.1549 s (TR-BDF2);
- 22.8074 s (FTCS); and
- 26.4529 s (MC),
3.3. Effectiveness of Adaptive Mesh Refinement
3.4. Approximations to Derivatives
4. Discussion
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Conflicts of Interest
References
- Andricopoulos, A.; Widdicks, M.; Duck, P.; Newton, D. Universal option valuation using quadrature methods. J. Financ. Econ. 2003, 67, 447–471. [Google Scholar] [CrossRef]
- Huang, M.; Luo, G. A simple and efficient numerical method for pricing discretely monitored early-exercise options. Appl. Math. Comput. 2022, 422, 126985. [Google Scholar] [CrossRef]
- Fusai, G.; Abrahams, I.; Sgarra, C. An exact analytical solution for discrete barrier options. Financ. Stochast. 2006, 10, 1–26. [Google Scholar] [CrossRef]
- Feng, L.; Linetsky, V. Pricing discretely monitored barrier options and defaultable bonds in Lévy process models: A fast Hilbert transform approach. Math. Financ. 2008, 18, 337–384. [Google Scholar] [CrossRef]
- Fang, F.; Oosterlee, C. Pricing early-exercise and discrete barrier options by Fourier-cosine series expansions. Numer. Math. 2009, 114, 27–62. [Google Scholar] [CrossRef]
- Feng, L.; Lin, X. Pricing Bermudan options in Lévy process models. SIAM J. Financ. Math. 2013, 4, 474–493. [Google Scholar] [CrossRef]
- Golbabai, A.; Ballestra, L.; Ahmadian, D. A highly accurate finite element method to price discrete double barrier options. Comput. Econ. 2014, 44, 153–173. [Google Scholar] [CrossRef]
- Broadie, M.; Glasserman, P.; Kou, S. A continuity correction for discrete barrier options. Math. Financ. 1997, 7, 325–348. [Google Scholar] [CrossRef]
- Wei, J. Valuation of discrete barrier options by interpolations. J. Deriv. 1998, 6, 51–73. [Google Scholar] [CrossRef]
- Ahn, D.H.; Figlewski, S.; Gao, B. Pricing discrete barrier options with an adaptive mesh model. J. Deriv. 1999, 6, 33–43. [Google Scholar] [CrossRef]
- Giles, M.; Carter, R. Convergence analysis of Crank-Nicolson and Rannacher time-marching. J. Comput. Financ. 2006, 9, 89–112. [Google Scholar] [CrossRef]
- Rannacher, R. Finite element solution of diffusion problems with irregular data. Numer. Math. 1984, 43, 309–327. [Google Scholar] [CrossRef]
- Le Floc’h, F. TR-BDF2 for fast stable American option pricing. J. Comput. Financ. 2014, 17, 31–56. [Google Scholar] [CrossRef]
- Shreve, S. Stochastic Calculus for Finance II: Continuous-Time Models; Springer: Berlin/Heidelberg, Germany, 2004. [Google Scholar]
- Hormander, L. The Analysis of Linear Partial Differential Operators I, 2nd ed.; Springer: Berlin/Heidelberg, Germany, 1990. [Google Scholar]
- Hull, J. Options, Futures, and Other Derivatives, 9th ed.; Pearson: New York, NY, USA, 2014. [Google Scholar]
- Strikwerda, J. Finite Difference Schemes and Partial Differential Equations, 2nd ed.; SIAM: Philadelphia, PA, USA, 2004. [Google Scholar]
Time Steps N | -Error | -Order | -Error | -Order |
---|---|---|---|---|
10 | 5.8171 × | − | 9.8610 × | − |
20 | 2.9073 × | 1.0006 | 4.8658 × | 1.0191 |
40 | 1.4550 × | 0.9986 | 2.4428 × | 0.9941 |
80 | 7.2763 × | 0.9997 | 1.2224 × | 0.9988 |
160 | 3.6379 × | 1.0001 | 6.1104 × | 1.0004 |
320 | 1.8189 × | 1.0000 | 3.0550 × | 1.0001 |
640 | 9.0947 × | 1.0000 | 1.5275 × | 1.0000 |
1280 | 4.5473 × | 1.0000 | 7.6376 × | 1.0000 |
2560 | 2.2737 × | 1.0000 | 3.8188 × | 1.0000 |
5120 | 1.1368 × | 1.0000 | 1.9094 × | 1.0000 |
Time Steps N | -Error | -Order | -Error | -Order |
---|---|---|---|---|
10 | 3.1317 × | − | 5.2137 × | − |
20 | 1.4875 × | 1.0741 | 2.4860 × | 1.0685 |
40 | 7.2892 × | 1.0290 | 1.2223 × | 1.0242 |
80 | 3.6387 × | 1.0023 | 6.1124 × | 0.9998 |
160 | 1.8189 × | 1.0003 | 3.0551 × | 1.0005 |
320 | 9.0947 × | 1.0000 | 1.5275 × | 1.0000 |
640 | 4.5473 × | 1.0000 | 7.6376 × | 1.0000 |
1280 | 2.2737 × | 1.0000 | 3.8188 × | 1.0000 |
2560 | 1.1368 × | 1.0000 | 1.9094 × | 1.0000 |
5120 | 5.6842 × | 1.0000 | 9.5470 × | 1.0000 |
Time Steps N | -Error | -Order | -Error | -Order |
---|---|---|---|---|
10 | 6.9281 × | − | 1.1685 × | − |
20 | 3.4987 × | 0.9856 | 5.8427 × | 0.9999 |
40 | 1.7599 × | 0.9913 | 2.9519 × | 0.9850 |
80 | 8.7137 × | 1.0142 | 1.4632 × | 1.0125 |
160 | 4.3621 × | 0.9983 | 7.3249 × | 0.9982 |
320 | 2.1824 × | 0.9991 | 3.6650 × | 0.9990 |
640 | 1.0915 × | 0.9995 | 1.8332 × | 0.9995 |
1280 | 5.4586 × | 0.9998 | 9.1678 × | 0.9997 |
2560 | 2.7285 × | 1.0004 | 4.5825 × | 1.0004 |
5120 | 1.3643 × | 0.9999 | 2.2914 × | 0.9999 |
Time Steps N | -Error | -Order | -Error | -Order |
---|---|---|---|---|
10 | 3.7822 × | − | 6.2695 × | − |
20 | 1.8067 × | 1.0659 | 3.0115 × | 1.0579 |
40 | 8.7547 × | 1.0452 | 1.4660 × | 1.0386 |
80 | 4.3694 × | 1.0026 | 7.3348 × | 0.9991 |
160 | 2.1841 × | 1.0004 | 3.6672 × | 1.0001 |
320 | 1.0920 × | 1.0000 | 1.8338 × | 0.9998 |
640 | 5.4600 × | 1.0000 | 9.1696 × | 0.9999 |
1280 | 2.7289 × | 1.0006 | 4.5831 × | 1.0005 |
2560 | 1.3644 × | 1.0000 | 2.2916 × | 1.0000 |
5120 | 6.8213 × | 1.0002 | 1.1457 × | 1.0001 |
Time Steps N | -Error | -Order | -Error | -Order |
---|---|---|---|---|
10 | 7.9800 × | − | 1.6636 × | − |
20 | 1.0897 × | 2.8725 | 1.5701 × | 3.4054 |
40 | 3.3141 × | 1.7172 | 5.0951 × | 1.6237 |
80 | 1.9199 × | 0.7876 | 3.7769 × | 0.4319 |
160 | 3.9259 × | 2.2900 | 7.8586 × | 2.2649 |
320 | 6.3321 × | 2.6323 | 1.2798 × | 2.6184 |
640 | 1.0403 × | 2.6057 | 1.6422 × | 2.9622 |
1280 | 2.8782 × | 1.8537 | 4.5740 × | 1.8441 |
2560 | 6.5587 × | 2.1337 | 9.9775 × | 2.1967 |
5120 | 2.0410 × | 1.6841 | 3.1296 × | 1.6727 |
Time Steps N | -Error | -Order | -Error | -Order |
---|---|---|---|---|
10 | 3.2530 × | − | 4.6209 × | − |
20 | 1.2858 × | 1.3391 | 1.6971 × | 1.4451 |
40 | 2.2103 × | 2.5404 | 3.4654 × | 2.2920 |
80 | 5.9012 × | 1.9052 | 9.1791 × | 1.9166 |
160 | 1.7804 × | 1.7288 | 2.6539 × | 1.7902 |
320 | 5.9818 × | 1.5736 | 8.2063 × | 1.6933 |
640 | 1.7355 × | 1.7852 | 2.3272 × | 1.8181 |
1280 | 4.5091 × | 1.9444 | 6.1307 × | 1.9245 |
2560 | 1.4927 × | 1.5949 | 1.9607 × | 1.6447 |
5120 | 3.0864 × | 2.2739 | 4.3884 × | 2.1596 |
Time Steps N | -Error | -Order | -Error | -Order |
---|---|---|---|---|
10 | 2.8546 × | − | 5.3502 × | − |
20 | 7.1561 × | 1.9961 | 1.3917 × | 1.9428 |
40 | 1.7810 × | 2.0065 | 3.4844 × | 1.9978 |
80 | 4.4342 × | 2.0059 | 8.7139 × | 1.9995 |
160 | 1.1058 × | 2.0035 | 2.1799 × | 1.9990 |
320 | 2.7600 × | 2.0024 | 5.4472 × | 2.0007 |
640 | 6.8835 × | 2.0034 | 1.3591 × | 2.0028 |
1280 | 1.7084 × | 2.0105 | 3.3713 × | 2.0113 |
2560 | 4.1531 × | 2.0404 | 8.1676 × | 2.0453 |
5120 | 9.0598 × | 2.1967 | 1.7631 × | 2.2118 |
Time Steps N | -Error | -Order | -Error | -Order |
---|---|---|---|---|
10 | 2.8384 × | − | 5.3502 × | − |
20 | 7.1193 × | 1.9953 | 1.3917 × | 1.9428 |
40 | 1.7723 × | 2.0061 | 3.4844 × | 1.9978 |
80 | 4.4128 × | 2.0059 | 8.7139 × | 1.9995 |
160 | 1.1009 × | 2.0030 | 2.1799 × | 1.9990 |
320 | 2.7493 × | 2.0016 | 5.4472 × | 2.0007 |
640 | 6.8627 × | 2.0022 | 1.3591 × | 2.0028 |
1280 | 1.7053 × | 2.0087 | 3.3713 × | 2.0113 |
2560 | 4.1528 × | 2.0379 | 8.1676 × | 2.0453 |
5120 | 9.0774 × | 2.1937 | 1.7631 × | 2.2118 |
Time Steps per Day | -Error | -Order | -Error | -Order |
---|---|---|---|---|
1 | 3.6069 × | − | 7.7073 × | − |
2 | 2.9071 × | 0.3112 | 1.0085 × | −0.3879 |
4 | 1.3482 × | 1.1085 | 5.5888 × | 0.8515 |
8 | 7.4259 × | 0.8604 | 7.8729 × | −0.4944 |
16 | 3.4649 × | 1.0997 | 4.5890 × | 0.7787 |
32 | 2.0030 × | 0.7907 | 7.1400 × | −0.6377 |
64 | 9.7519 × | 1.0384 | 4.3468 × | 0.7160 |
Time Steps per Day | -Error | -Order | -Error | -Order |
---|---|---|---|---|
1 | 2.9450 × | − | 1.0086 × | − |
2 | 1.3587 × | 1.1161 | 5.5891 × | 0.8516 |
4 | 7.2129 × | 0.9135 | 1.5366 × | 1.8628 |
8 | 3.5757 × | 1.0123 | 4.5890 × | −1.5784 |
16 | 1.8192 × | 0.9749 | 1.4147 × | 1.6977 |
32 | 1.0506 × | 0.7922 | 4.3468 × | −1.6195 |
64 | 4.5819 × | 1.1972 | 1.5059 × | 1.5293 |
Time Steps per Day | -Error | -Order | -Error | -Order |
---|---|---|---|---|
1 | 9.1679 × | − | 1.0413 × | − |
2 | 5.1266 × | 0.8386 | 8.4570 × | 0.3002 |
4 | 1.4637 × | 1.8084 | 2.5410 × | 1.7347 |
8 | 6.3903 × | 1.1957 | 2.2136 × | 0.1990 |
16 | 1.7888 × | 1.8369 | 7.1738 × | 1.6256 |
32 | 7.8390 × | 1.1902 | 5.4218 × | 0.4040 |
64 | 2.2096 × | 1.8269 | 2.0286 × | 1.4183 |
Time Steps per Day | -Error | -Order | -Error | -Order |
---|---|---|---|---|
1 | 6.0032 × | − | 8.4504 × | − |
2 | 1.2291 × | 2.2881 | 2.0014 × | 2.0780 |
4 | 5.0400 × | 1.2862 | 1.3139 × | 0.6072 |
8 | 1.3808 × | 1.8679 | 4.9008 × | 1.4227 |
16 | 6.3195 × | 1.1276 | 3.2296 × | 0.6017 |
32 | 1.3910 × | 2.1837 | 9.1382 × | 1.8214 |
64 | 8.1619 × | 0.7691 | 7.7478 × | 0.2381 |
Time Steps per Day | -Error | -Order | -Error | -Order |
---|---|---|---|---|
1 | 3.4536 × | − | 1.6624 × | − |
2 | 4.8800 × | 2.8232 | 3.9060 × | 2.0895 |
4 | 1.0948 × | 2.1561 | 1.4502 × | 1.4294 |
8 | 2.8768 × | 1.9282 | 2.8341 × | 2.3553 |
16 | 8.0608 × | 1.8355 | 8.4779 × | 1.7411 |
32 | 2.0010 × | 2.0102 | 1.8274 × | 2.2140 |
64 | 4.2000 × | 2.2523 | 4.8192 × | 1.9229 |
Time Steps per Day | -Error | -Order | -Error | -Order |
---|---|---|---|---|
1 | 4.8584 × | − | 3.9005 × | − |
2 | 1.2210 × | 1.9925 | 1.4489 × | 1.4288 |
4 | 3.0740 × | 1.9899 | 2.8372 × | 2.3524 |
8 | 8.6209 × | 1.8342 | 8.4697 × | 1.7441 |
16 | 2.1269 × | 2.0191 | 1.8294 × | 2.2110 |
32 | 4.5269 × | 2.2322 | 4.8141 × | 1.9260 |
64 | 9.7158 × | 5.5421 | 3.4793 × | 7.1123 |
Time Steps per Day | -Error | -Order | -Error | -Order |
---|---|---|---|---|
1 | 5.7654 × | − | 1.2330 × | − |
2 | 2.7923 × | 1.0460 | 5.9944 × | 1.0405 |
4 | 1.2227 × | 1.1914 | 2.6136 × | 1.1976 |
8 | 5.6326 × | 1.1181 | 1.2007 × | 1.1222 |
16 | 2.7276 × | 1.0462 | 5.8052 × | 1.0485 |
32 | 1.3349 × | 1.0309 | 2.8390 × | 1.0319 |
64 | 6.6204 × | 1.0118 | 1.4074 × | 1.0124 |
Time Steps per Day | -Error | -Order | -Error | -Order |
---|---|---|---|---|
1 | 4.1522 × | − | 8.7929 × | − |
2 | 2.1859 × | 0.9256 | 4.6308 × | 0.9251 |
4 | 1.0773 × | 1.0208 | 2.2860 × | 1.0184 |
8 | 5.2753 × | 1.0301 | 1.1204 × | 1.0289 |
16 | 2.6388 × | 0.9994 | 5.6054 × | 0.9991 |
32 | 1.3128 × | 1.0072 | 2.7893 × | 1.0069 |
64 | 6.5650 × | 0.9997 | 1.3950 × | 0.9997 |
Time Steps per Day | CN-C1 | CN-RAN | ||
Error | CPU Time | Error | CPU Time | |
1 | 6.7233 × | 0.5618 | 1.1520 × | 0.1195 |
2 | 3.1867 × | 0.6440 | 5.5935 × | 0.2298 |
4 | 1.9737 × | 0.8517 | 2.4723 × | 0.3972 |
8 | 6.3714 × | 1.4262 | 1.1473 × | 0.8562 |
16 | 1.8043 × | 2.8770 | 5.5642 × | 2.1088 |
32 | 4.5282 × | 7.3977 | 2.7281 × | 8.5549 |
64 | 9.4676 × | 23.4999 | 1.3534 × | 46.2784 |
Time Steps per Day | TR-BDF2 | FTCS | ||
Error | CPU Time | Error | CPU Time | |
1 | 8.5771 × | 0.1145 | 1.3770 × | 0.0648 |
2 | 4.4429 × | 0.2203 | 6.7278 × | 0.1141 |
4 | 2.1929 × | 0.4887 | 3.3502 × | 0.2415 |
8 | 1.0782 × | 1.2014 | 1.6546 × | 0.5837 |
16 | 5.3920 × | 3.8852 | 8.2700 × | 1.6694 |
32 | 2.6851 × | 19.8665 | 4.1230 × | 5.1475 |
64 | 1.3427 × | 96.9560 | 2.0614 × | 21.6645 |
Number of Paths | MC | |||
Error | CPU Time | |||
40,000 | 2.6953 × | 13.1037 | ||
60,000 | 5.6742 × | 17.2020 | ||
80,000 | 6.3685 × | 22.7554 | ||
100,000 | 3.2074 × | 28.0916 | ||
120,000 | 1.6717 × | 33.6178 | ||
140,000 | 3.2980 × | 38.8197 | ||
160,000 | 3.2803 × | 44.4004 |
Time Steps per Day | CN-C1 | Time Steps per Day | CN-RAN | ||
Error | CPU Time | Error | CPU Time | ||
1 | 6.7233 × | 0.5618 | 43 | 2.0210 × | 16.2035 |
− | − | − | 44 | 1.9749 × | 17.3225 |
− | − | − | 43.4555 * | 2.0000 × | 16.7132 * |
Time Steps per Day | TR-BDF2 | Time Steps per Day | FTCS | ||
Error | CPU Time | Error | CPU Time | ||
42 | 2.0449 × | 34.4220 | 65 | 2.0309 × | 21.8704 |
43 | 1.9971 × | 36.2668 | 66 | 1.9978 × | 22.8741 |
42.9393 * | 2.0000 × | 36.1549 * | 65.9335 * | 2.0000 × | 22.8074 * |
Number of Path | MC | ||||
Error | CPU Time | ||||
108,300 | 2.1369 × | 26.7155 | |||
108,400 | 1.6615 × | 25.8035 | |||
108,328.80 * | 2.0000 × | 26.4529 * |
Uniform Grid with Time Steps per Day | Adaptive Mesh with Time Steps per Day | Save in CPU Time | |||
---|---|---|---|---|---|
Error | CPU Time | Error | CPU Time | ()/ | |
1 | 6.3714 × | 1.4262 | 1.3181 × | 0.5203 | 63.52% |
2 | 1.8043 × | 2.8770 | 3.6323 × | 1.0140 | 64.75% |
4 | 4.5282 × | 7.3977 | 9.2715 × | 2.6514 | 64.16% |
8 | 9.4676 × | 23.4999 | 2.1480 × | 7.7067 | 67.21% |
Time Steps per Day | V | |||
-Error | -Order | -Error | -Order | |
1 | 4.9821 × | − | 1.1748 × | − |
2 | 1.2441 × | 2.0017 | 2.9359 × | 2.0006 |
4 | 3.1037 × | 2.0031 | 7.3259 × | 2.0027 |
8 | 7.6925 × | 2.0124 | 1.8167 × | 2.0117 |
16 | 1.9033 × | 2.0150 | 4.4944 × | 2.0151 |
32 | 4.5273 × | 2.0718 | 1.0692 × | 2.0716 |
64 | 9.0650 × | 2.3203 | 2.1407 × | 2.3203 |
Time Steps per Day | ||||
-Error | -Order | -Error | -Order | |
1 | 5.7753 × | − | 2.9170 × | − |
2 | 1.3173 × | 2.1323 | 6.8630 × | 2.0876 |
4 | 3.2319 × | 2.0272 | 1.5790 × | 2.1198 |
8 | 8.0164 × | 2.0113 | 3.8938 × | 2.0198 |
16 | 1.9799 × | 2.0175 | 9.6006 × | 2.0200 |
32 | 4.7122 × | 2.0710 | 2.2842 × | 2.0714 |
64 | 9.4293 × | 2.3212 | 4.5697 × | 2.3215 |
Time Steps per Day | ||||
-Error | -Order | -Error | -Order | |
1 | 5.2142 × | − | 4.5269 × | − |
2 | 1.0219 × | 2.3512 | 7.7774 × | 2.5411 |
4 | 2.1477 × | 2.2504 | 1.7798 × | 2.1275 |
8 | 4.9782 × | 2.1091 | 4.9207 × | 1.8548 |
16 | 1.1808 × | 2.0758 | 1.2036 × | 2.0316 |
32 | 2.7632 × | 2.0954 | 3.1979 × | 1.9121 |
64 | 5.5058 × | 2.3273 | 6.8740 × | 2.2179 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Luo, G.; Huang, M. An Analytically Modified Finite Difference Scheme for Pricing Discretely Monitored Options. Mathematics 2025, 13, 241. https://doi.org/10.3390/math13020241
Luo G, Huang M. An Analytically Modified Finite Difference Scheme for Pricing Discretely Monitored Options. Mathematics. 2025; 13(2):241. https://doi.org/10.3390/math13020241
Chicago/Turabian StyleLuo, Guo, and Min Huang. 2025. "An Analytically Modified Finite Difference Scheme for Pricing Discretely Monitored Options" Mathematics 13, no. 2: 241. https://doi.org/10.3390/math13020241
APA StyleLuo, G., & Huang, M. (2025). An Analytically Modified Finite Difference Scheme for Pricing Discretely Monitored Options. Mathematics, 13(2), 241. https://doi.org/10.3390/math13020241