IDEAS home Printed from https://ideas.repec.org/a/taf/apeclt/v26y2019i10p835-842.html
   My bibliography  Save this article

A generalized algorithm for duration and convexity of option embedded bonds

Author

Listed:
  • Ghassem A. Homaifar
  • Frank A. Michello

Abstract

This article derives a generalized algorithm for duration and convexity of option embedded bonds that provides a convenient way of estimating the dollar value of 1 basis point change in yield known as DV01, an important metric in the bond market. As delta approaches 1, duration of callable bonds approaches zero once the bond is called. However, when the delta is zero, the short call is worthless and duration of callable will be equal to that of a straight bond. On the other hand, the convexity of a callable bond follows the same behaviour when the delta is 1 as shown in Dunetz and Mahoney (1988) as well as in Mehran and Homaifar’s (1993) derivations. However, in the case when delta is zero, the convexity of a callable bond approaches zero as well, which is in stark contrast to the non-zero convexity derived in Dunetz and Mahoney’s paper. Our generalized algorithm shows that duration and convexity nearly symmetrically underestimate (overestimate) the actual price change by 11/10 basis points for ± 100 basis points change in yield. Furthermore, our algorithm reduces to that of MH for convertible bonds assuming the convertible bond is not callable.

Suggested Citation

  • Ghassem A. Homaifar & Frank A. Michello, 2019. "A generalized algorithm for duration and convexity of option embedded bonds," Applied Economics Letters, Taylor & Francis Journals, vol. 26(10), pages 835-842, June.
  • Handle: RePEc:taf:apeclt:v:26:y:2019:i:10:p:835-842
    DOI: 10.1080/13504851.2018.1502862
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/13504851.2018.1502862
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/13504851.2018.1502862?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.

    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:taf:apeclt:v:26:y:2019:i:10:p:835-842. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAEL20 .

    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.