IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2108.10418.html
   My bibliography  Save this paper

On the Efficiency of 5(4) RK-Embedded Pairs with High Order Compact Scheme and Robin Boundary Condition for Options Valuation

Author

Listed:
  • Chinonso Nwankwo
  • Weizhong Dai

Abstract

When solving the American options with or without dividends, numerical methods often obtain lower convergence rates if further treatment is not implemented even using high-order schemes. In this article, we present a fast and explicit fourth-order compact scheme for solving the free boundary options. In particular, the early exercise features with the asset option and option sensitivity are computed based on a coupled of nonlinear PDEs with fixed boundaries for which a high order analytical approximation is obtained. Furthermore, we implement a new treatment at the left boundary by introducing a third-order Robin boundary condition. Rather than computing the optimal exercise boundary from the analytical approximation, we simply obtain it from the asset option based on the linear relationship at the left boundary. As such, a high order convergence rate can be achieved. We validate by examples that the improvement at the left boundary yields a fourth-order convergence rate without further implementation of mesh refinement, Rannacher time-stepping, and/or smoothing of the initial condition. Furthermore, we extensively compare, the performance of our present method with several 5(4) Runge-Kutta pairs and observe that Dormand and Prince and Bogacki and Shampine 5(4) pairs are faster and provide more accurate numerical solutions. Based on numerical results and comparison with other existing methods, we can validate that the present method is very fast and provides more accurate solutions with very coarse grids.

Suggested Citation

  • Chinonso Nwankwo & Weizhong Dai, 2021. "On the Efficiency of 5(4) RK-Embedded Pairs with High Order Compact Scheme and Robin Boundary Condition for Options Valuation," Papers 2108.10418, arXiv.org, revised Apr 2022.
  • Handle: RePEc:arx:papers:2108.10418
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2108.10418
    File Function: Latest version
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chinonso Nwankwo & Weizhong Dai & Tony Ware, 2023. "Enhancing accuracy for solving American CEV model with high-order compact scheme and adaptive time stepping," Papers 2309.03984, arXiv.org, revised Sep 2023.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2108.10418. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.