Nothing Special   »   [go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/ris/iosalg/0028.html
   My bibliography  Save this article

An efficient algorithm for the calculation of reserves for non-unit linked life policies

Author

Listed:
  • Tucker, Mark

    (The University of Edinburgh)

  • Bull, J. Mark
Abstract
The underlying stochastic nature of the requirements for the Solvency II regulations has introduced significant challenges if the required calculations are to be performed correctly, without resorting to excessive approximations, within practical timescales. It is generally acknowledged by practising actuaries within UK life offices that it is currently impossible to correctly fulfil the requirements imposed by Solvency II using existing computational techniques based on commercially available valuation packages. Our work has already shown that it is possible to perform profitability calculations at a far higher rate than is achievable using commercial packages. One of the key factors in achieving these gains is to calculate reserves using recurrence relations that scale linearly with the number of time steps. Here, we present a general vector recurrence relation which can be used for a wide range of non-unit linked policies that are covered by Solvency II; such contracts include annuities, term assurances, and endowments. Our results suggest that by using an optimised parallel implementation of this algorithm, on an affordable hardware platform, it is possible to perform the ‘brute force’ approach to demonstrating solvency in a realistic timescale (of the order of a few hours).

Suggested Citation

  • Tucker, Mark & Bull, J. Mark, 2014. "An efficient algorithm for the calculation of reserves for non-unit linked life policies," Algorithmic Finance, IOS Press, vol. 3(3-4), pages 143-161.
    • Handle: RePEc:ris:iosalg:0028
    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 search for a similarly titled item that would be available.

    More about this item

    Keywords

    Solvency II; non-unit linked life reserves; brute force; parallel programming; OpenMP;
    All these keywords.

    JEL classification:

    • C00 - Mathematical and Quantitative Methods - - General - - - General

    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:ris:iosalg:0028. 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: Saskia van Wijngaarden (email available below). General contact details of provider: http://www.iospress.nl/ .

    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.