A non linear approximation method for solving high dimensional partial differential equations: application in finance

From MaRDI portal
Publication:1996929

DOI10.1016/J.MATCOM.2016.07.013zbMATH Open1483.91253arXiv1309.3731OpenAlexW1612195359MaRDI QIDQ1996929FDOQ1996929


Authors: Yanyan Li Edit this on Wikidata


Publication date: 1 March 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Abstract: We study an algorithm which has been proposed by Chinesta et al. to solve high-dimensional partial differential equations. The idea is to represent the solution as a sum of tensor products and to compute iteratively the terms of this sum. This algorithm is related to the so-called greedy algorithm introduced by Temlyakov. In this paper, we investigate the application of the greedy algorithm in finance and more precisely to the option pricing problem. We approximate the solution to the Black-Scholes equation and we propose a variance reduction method. In numerical experiments, we obtain results for up to 10 underlyings. Besides, the proposed variance reduction method permits an important reduction of the variance in comparison with a classical Monte Carlo method.


Full work available at URL: https://arxiv.org/abs/1309.3731




Recommendations




Cites Work


Cited In (5)





This page was built for publication: A non linear approximation method for solving high dimensional partial differential equations: application in finance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996929)