Skip to main content Accessibility help
×
Home

A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and its Applications in Financial Engineering

  • Ning Cai (a1), S. G. Kou (a2) and Zongjian Liu (a3)

Abstract

Transform-based algorithms have wide applications in applied probability, but rarely provide computable error bounds to guarantee the accuracy. We propose an inversion algorithm for two-sided Laplace transforms with computable error bounds. The algorithm involves a discretization parameter C and a truncation parameter N. By choosing C and N using the error bounds, the algorithm can achieve any desired accuracy. In many cases, the bounds decay exponentially, leading to fast computation. Therefore, the algorithm is especially suitable to provide benchmarks. Examples from financial engineering, including valuation of cumulative distribution functions of asset returns and pricing of European and exotic options, show that our algorithm is fast and easy to implement.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and its Applications in Financial Engineering
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and its Applications in Financial Engineering
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and its Applications in Financial Engineering
      Available formats
      ×

Copyright

Corresponding author

Postal address: Department of Industrial Engineering and Logistics Management, The Hong Kong University of Science and Technology, Room 5551, Clear Water Bay, Kowloon, Hong Kong. Email address: ningcai@ust.hk
∗∗ Postal address: Risk Management Institute and Department of Mathematics, National University of Singapore, I3 Building #04-03, 21 Heng Mui Keng Terrace, Singapore 119613.
∗∗∗ Postal address: Columbia University, 313A S. W. Mudd Building, 500 W. 120th Street, New York, NY 10027, USA.

References

Hide All
[1] Abate, J. and Whitt, W. (1992). The Fourier-series method for inverting transforms of probability distributions. Queueing Systems 10, 587.
[2] Broadie, M. and Yamamoto, Y. (2003). Application of the fast Gauss transform to option pricing. Manag. Sci. 49, 10711088.
[3] Cai, N. and Kou, S. G. (2011). Option pricing under a mixed-exponential Jump diffusion model. Manag. Sci. 57, 20672081.
[4] Cai, N., Kou, S. G. and Liu, Z. (2013). A two-sided Laplace inversion algorithm with computable error bounds and its application in financial engineering. Electronic companion. Available at http://ihome.ust.hk/∼ningcai/index_IELM_1.html.
[5] Cai, N., Peng, X. and Shi, C. (2013). Maximum-likelihood estimation via two-sided Laplace inversion with error control. Working paper.
[6] Carr, P. and Madan, D. B. (1999). Option valuation using the fast Fourier transform. J. Computational Finance 2, 6173.
[7] Carr, P. and Madan, D. (2009). Saddlepoint methods for option pricing. J. Computational Finance 13, 4961.
[8] Feng, L. and Lin, X. (2013). Inverting analytic characteristic functions and financial applications. SIAM J. Financial Math. 4, 372398.
[9] Feng, L. and Linetsky, V. (2008). Pricing discretely monitored barrier options and defaultable bonds in Lévy process models: a fast Hilbert transform approach. Math. Finance 18, 337384.
[10] Feng, L. and Linetsky, V. (2009). Computing exponential moments of the discrete maximum of a Lévy process and lookback options. Finance Stoch. 13, 501529.
[11] Kou, S. G. and Wang, H. (2004). Option pricing under a double exponential Jump diffusion model. Manag. Sci. 50, 11781192.
[12] Lee, R. W. (2004). Option pricing by transform methods: extensions, unification, and error control. J. Computational Finance 7, 5186.
[13] Olver, F. W. J. (1974). Asymptotics and Special Functions. Academic Press, New York.
[14] Petrella, G. (2004). An extension of the Euler Laplace transform inversion algorithm with applications in option pricing. Operat. Res. Lett. 32, 380389.
[15] Zygmund, A. (1968). Trigonometric Series, 2nd edn. Cambridge University Press.

Keywords

MSC classification

A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and its Applications in Financial Engineering

  • Ning Cai (a1), S. G. Kou (a2) and Zongjian Liu (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.