activity
20162021
most citedThe Chebyshev method for the implied volatility

7 citations · 9 across the 5 of their papers we have counts for

collaborators
Showing q-fin.CPShow all

8 papers · 1 filter

q-fin.CP2020★ 2 cited

The Deep Parametric PDE Method: Application to Option Pricing

Kathrin Glau, Linus Wunderlich

We propose the deep parametric PDE method to solve high-dimensional parametric partial differential equations. A single neural network approximates the solution of a whole family o…

q-fin.CP2019

Speed-up credit exposure calculations for pricing and risk management

Kathrin Glau, Ricardo Pachon, Christian Pötz

We introduce a new method to calculate the credit exposure of European and path-dependent options. The proposed method is able to calculate accurate expected exposure and potential…

q-fin.CP2019

Weighted Monte Carlo with least squares and randomized extended Kaczmarz for option pricing

Damir Filipović, Kathrin Glau, Yuji Nakatsukasa +1

We propose a methodology for computing single and multi-asset European option prices, and more generally expectations of scalar functions of (multivariate) random variables. This n…

q-fin.CP2019

Fast Calculation of Credit Exposures for Barrier and Bermudan options using Chebyshev interpolation

Kathrin Glau, Ricardo Pachon, Christian Pötz

We introduce a new method to calculate the credit exposure of Bermudan, discretely monitored barrier and European options. Core of the approach is the application of the dynamic Ch…

q-fin.CP2019

Low-rank tensor approximation for Chebyshev interpolation in parametric option pricing

Kathrin Glau, Daniel Kressner, Francesco Statti

Treating high dimensionality is one of the main challenges in the development of computational methods for solving problems arising in finance, where tasks such as pricing, calibra…

q-fin.CP2018

A new approach for American option pricing: The Dynamic Chebyshev method

Kathrin Glau, Mirco Mahlstedt, Christian Pötz

We introduce a new method to price American options based on Chebyshev interpolation. In each step of a dynamic programming time-stepping we approximate the value function with Che…