Overcoming the curse of dimensionality in the approximative pricing of financial derivatives with default risks
Authors:
- Martin HutzenthalerMHMartin Hutzenthaler
- Arnulf JentzenAJArnulf Jentzen
- von Wurstemberger WurstembergerVWvon Wurstemberger Wurstemberger
Open Access
- 1 January 2020
- journal article
- research article
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 25 (none) , 1-73
Abstract
Parabolic partial differential equations (PDEs) are widely used in the mathematical modeling of natural phenomena and man-made complex systems. In particular, parabolic PDEs are a fundamental tool to approximately determine fair prices of financial derivatives in the financial engineering industry. The PDEs appearing in financial engineering applications are often nonlinear (e.g., in PDE models which take into account the possibility of a defaulting counterparty) and high-dimensional since the dimension typically corresponds to the number of considered financial assets. A major issue in the scientific literature is that most approximation methods for nonlinear PDEs suffer from the so-called curse of dimensionality in the sense that the computational effort to compute an approximation with a prescribed accuracy grows exponentially in the dimension of the PDE or in the reciprocal of the prescribed approximation accuracy and nearly all approximation methods for nonlinear PDEs in the scientific literature have not been shown not to suffer from the curse of dimensionality. Recently, a new class of approximation schemes for semilinear parabolic PDEs, termed full history recursive multilevel Picard (MLP) algorithms, were introduced and it was proven that MLP algorithms do overcome the curse of dimensionality for semilinear heat equations. In this paper we extend and generalize those findings to a more general class of semilinear PDEs which includes as special cases the important examples of semilinear Black-Scholes equations used in pricing models for financial derivatives with default risks. In particular, we introduce an MLP algorithm for the approximation of solutions of semilinear Black-Scholes equations and prove, under the assumption that the nonlinearity in the PDE is globally Lipschitz continuous, that the computational effort of the proposed method grows at most polynomially in both the dimension and the reciprocal of the prescribed approximation accuracy. We thereby establish, for the first time, that the numerical approximation of solutions of semilinear Black-Scholes equations is a polynomially tractable approximation problem.Keywords
All Related Versions
This publication has 85 references indexed in Scilit:
- A Sparse-Grid Method for Multi-Dimensional Backward Stochastic Differential EquationsJournal of Computational Mathematics, 2018
- COUNTERPARTY RISK AND FUNDING: THE FOUR WINGS OF THE TVAInternational Journal of Theoretical and Applied Finance, 2013
- Counterparty Risk Valuation: A Marked Branching Diffusion ApproachSSRN Electronic Journal, 2012
- Monte Carlo solution of Cauchy problem for a nonlinear parabolic equationMathematics and Computers in Simulation, 2010
- Discretization of forward–backward stochastic differential equations and related quasi-linear parabolic equationsIMA Journal of Numerical Analysis, 2007
- Rate of convergence of an empirical regression method for solving generalized backward stochastic differential equationsBernoulli, 2006
- A regression-based Monte Carlo method to solve backward stochastic differential equationsThe Annals of Applied Probability, 2005
- A quantization algorithm for solving multidimensional discrete-time optimal stopping problemsBernoulli, 2003
- Forward-backward stochastic differential equations and quasilinear parabolic PDEsProbability Theory and Related Fields, 1999
- Solving forward-backward stochastic differential equations explicitly — a four step schemeProbability Theory and Related Fields, 1994