IDEAS home Printed from https://ideas.repec.org/a/taf/quantf/v22y2022i3p447-462.html
   My bibliography  Save this article

A fast algorithm for simulation of rough volatility models

Author

Listed:
  • Jingtang Ma
  • Haofei Wu

Abstract

A rough volatility model contains a stochastic Volterra integral with a weakly singular kernel. The classical Euler-Maruyama algorithm is not very efficient for simulating this kind of model because one needs to keep records of all the past path-values and thus the computational complexity is too large. This paper develops a fast two-step iteration algorithm using an approximation of the weakly singular kernel with a sum of exponential functions. Compared to the Euler-Maruyama algorithm, the complexity of the fast algorithm is reduced from $ O(N^{2}) $ O(N2) to $ O(N\log N) $ O(Nlog⁡N) or $ O(N\log ^{2} N) $ O(Nlog2⁡N) for simulating one path, where N is the number of time steps. Further, the fast algorithm is developed to simulate rough Heston models with (or without) regime switching, and multi-factor approximation algorithms are also studied and compared. The convergence rates of the Euler-Maruyama algorithm and the fast algorithm are proved. A number of numerical examples are carried out to confirm the high efficiency of the proposed algorithm.

Suggested Citation

  • Jingtang Ma & Haofei Wu, 2022. "A fast algorithm for simulation of rough volatility models," Quantitative Finance, Taylor & Francis Journals, vol. 22(3), pages 447-462, March.
  • Handle: RePEc:taf:quantf:v:22:y:2022:i:3:p:447-462
    DOI: 10.1080/14697688.2021.1970213
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/14697688.2021.1970213?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:quantf:v:22:y:2022:i:3:p:447-462. 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/RQUF20 .

    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.