Fast Greeks by algorithmic differentiation

Luca Capriotti

Journal of Computational Finance

Abstract: ABSTRACT We show how algorithmic differentiation can be used to efficiently implement the pathwise derivative method for the calculation of option sensitivities using Monte Carlo simulations. The main practical difficulty of the pathwise derivative method is that it requires the differentiation of the payout function. For the type of structured options for which Monte Carlo simulations are usually employed, these derivatives are typically cumbersome to calculate analytically, and too time consuming to evaluate with standard finite-difference approaches. In this paper we address this problem and show how algorithmic differentiation can be employed to calculate these derivatives very efficiently and with machine-precision accuracy. We illustrate the basic workings of this computational technique by means of simple examples, and we demonstrate with several numerical tests how the pathwise derivative method combined with algorithmic differentiation - especially in the adjoint mode - can provide speed-ups of several orders of magnitude with respect to standard methods.

References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.risk.net/journal-of-computational-fina ... hmic-differentiation (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rsk:journ0:2160393

Access Statistics for this article

More articles in Journal of Computational Finance from Journal of Computational Finance
Bibliographic data for series maintained by Thomas Paine (maintainer@infopro-digital.com).