Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Numerical valuation of American basket options via partial differential complementarity problems (2106.01200v1)

Published 2 Jun 2021 in math.NA, cs.CE, cs.NA, and q-fin.CP

Abstract: We study the principal component analysis based approach introduced by Reisinger & Wittum (2007) and the comonotonic approach considered by Hanbali & Linders (2019) for the approximation of American basket option values via multidimensional partial differential complementarity problems (PDCPs). Both approximation approaches require the solution of just a limited number of low-dimensional PDCPs. It is demonstrated by ample numerical experiments that they define approximations that lie close to each other. Next, an efficient discretisation of the pertinent PDCPs is presented that leads to a favourable convergence behaviour.

Summary

We haven't generated a summary for this paper yet.