IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v229y2025icp673-689.html
   My bibliography  Save this article

An adaptive positive preserving numerical scheme based on splitting method for the solution of the CIR model

Author

Listed:
  • Kamrani, Minoo
  • Hausenblas, Erika

Abstract

This paper aims to investigate an adaptive numerical method based on a splitting scheme for the Cox–Ingersoll–Ross (CIR) model. The main challenge associated with numerically simulating the CIR process lies in the fact that most existing numerical methods fail to uphold the positive nature of the solution. Within this article, we present an innovative adaptive splitting scheme. Due to the existence of a square root in the CIR model, the step size is adaptively selected to ensure that, at each step, the value under the square-root does not fall under a given positive level and it is bounded. Moreover, an alternate numerical method is employed if the chosen step size becomes excessively small or the solution derived from the splitting scheme turns negative. This alternative approach, characterized by convergence and positivity preservation, is called the “backstop method”.

Suggested Citation

  • Kamrani, Minoo & Hausenblas, Erika, 2025. "An adaptive positive preserving numerical scheme based on splitting method for the solution of the CIR model," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 229(C), pages 673-689.
  • Handle: RePEc:eee:matcom:v:229:y:2025:i:c:p:673-689
    DOI: 10.1016/j.matcom.2024.10.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424004117
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2024.10.021?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:matcom:v:229:y:2025:i:c:p:673-689. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.