IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-05236139.html
   My bibliography  Save this paper

Approximate Closed-Form Solutions for Pricing Zero-Coupon Bonds in the Zero Lower Bound Framework

Author

Listed:
  • Jae-Yun Jun

    (Ecole Centrale d'Electronique)

  • Yves Rakotondratsimba

    (Ecole Centrale d'Electronique)

Abstract

After the 2007 financial crisis, many central banks adopted policies to lower their interest rates; the dynamics of these rates cannot be captured using classical models. Recently, Meucci and Loregian proposed an approach to estimate nonnegative interest rates using the inverse-call transformation. Despite the fact that their work is distinguished from others in the literature by their consideration of practical aspects, some technical difficulties still remain, such as the lack of analytic expression for the zero-coupon bond (ZCB) price. In this work, we propose novel approximate closed-form solutions for the ZCB price in the zero lower bound (ZLB) framework, when the underlying shadow rate is assumed to follow the classical one-factor Vasicek model. Then, a filtering procedure is performed using the Unscented Kalman Filter (UKF) to estimate the unobservable state variable (the shadow rate), and the model calibration is proceeded by estimating the model parameters using the Particle Swarm Optimization (PSO) algorithm. Further, empirical illustrations are given and discussed using (as input data) the interest rates of the AAA-rated bonds compiled by the European Central Bank ranging from 6 September 2004 to 21 June 2012 (a period that concerns the ZLB framework). Our approximate closed-form solution is able to show a good match between the actual and estimated yield-rate values for short and medium time-to-maturity values, whereas, for long time-to-maturity values, it is able to estimate the trend of the yield rates.

Suggested Citation

  • Jae-Yun Jun & Yves Rakotondratsimba, 2024. "Approximate Closed-Form Solutions for Pricing Zero-Coupon Bonds in the Zero Lower Bound Framework," Post-Print hal-05236139, HAL.
  • Handle: RePEc:hal:journl:hal-05236139
    DOI: 10.3390/math12172690
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    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:hal:journl:hal-05236139. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.