An Adaptive and Explicit Fourth Order Runge-Kutta-Fehlberg Method Coupled with Compact Finite Differencing for Pricing American Put Options
We propose an adaptive and explicit fourth-order Runge-Kutta-Fehlberg method coupled with a fourth-order compact scheme to solve the American put options problem. First, the free boundary problem is converted into a system of partial differential equations with a fixed domain by using logarithm transformation and taking additional derivatives. With the addition of an intermediate function with a fixed free boundary, a quadratic formula is derived to compute the velocity of the optimal exercise boundary analytically. Furthermore, we implement an extrapolation method to ensure that at least, a third-order accuracy in space is maintained at the boundary point when computing the optimal exercise boundary from its derivative. As such, it enables us to employ fourth-order spatial and temporal discretization with Dirichlet boundary conditions for obtaining the numerical solution of the asset option, option Greeks, and the optimal exercise boundary. The advantage of the Runge-Kutta-Fehlberg method is based on error control and the adjustment of the time step to maintain the error at a certain threshold. By comparing with some existing methods in the numerical experiment, it shows that the present method has a better performance in terms of computational speed and provides a more accurate solution.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Explicit RKF-Compact Scheme for Pricing Regime Switching American Options with Varying Time Step
In this research work, an explicit Runge-Kutta-Fehlberg (RKF) time integration with a fourth-order compact finite difference scheme in space and a high order analytical approximation of the optimal exercise boundary is e…
Optimising 4th-Order Runge-Kutta Methods: A Dynamic Heuristic Approach for Efficiency and Low Storage
Extended Stability Runge-Kutta (ESRK) methods are crucial for solving large-scale computational problems in science and engineering, including weather forecasting, aerodynamic analysis, and complex biological modelling. …
AutoMLComputational EfficiencyHeuristic SearchReinforcement Learning (RL)+1Stochastic Runge-Kutta methods and adaptive SGD-G2 stochastic gradient descent
The minimization of the loss function is of paramount importance in deep neural networks. On the other hand, many popular optimization algorithms have been shown to correspond to some evolution equation of gradient flow …
Pricing American options with the Runge-Kutta-Legendre finite difference scheme
This paper presents the Runge-Kutta-Legendre finite difference scheme, allowing for an additional shift in its polynomial representation. A short presentation of the stability region, comparatively to the Runge-Kutta-Che…
Instabilities of Super-Time-Stepping Methods on the Heston Stochastic Volatility Model
This note explores in more details instabilities of explicit super-time-stepping schemes, such as the Runge-Kutta-Chebyshev or Runge-Kutta-Legendre schemes, noticed in the litterature, when applied to the Heston stochast…