Low-rank tensor approximation for Chebyshev interpolation in parametric option pricing
K Glau, D Kressner, F Statti - SIAM Journal on Financial Mathematics, 2020 - SIAM
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 …
computational methods for solving problems arising in finance, where tasks such as pricing …
Radial basis functions with partition of unity method for American options with stochastic volatility
In this article, we price American options under Heston's stochastic volatility model using a
radial basis function (RBF) with partition of unity method (PUM) applied to a linear …
radial basis function (RBF) with partition of unity method (PUM) applied to a linear …
[HTML][HTML] A deep learning approach for computations of exposure profiles for high-dimensional Bermudan options
K Andersson, CW Oosterlee - Applied Mathematics and Computation, 2021 - Elsevier
In this paper, we propose a neural network-based method for approximating expected
exposures and potential future exposures of Bermudan options. In a first phase, the method …
exposures and potential future exposures of Bermudan options. In a first phase, the method …
Efficient computation of exposure profiles for counterparty credit risk
CSL De Graaf, Q Feng, D Kandhai… - International Journal of …, 2014 - World Scientific
Three computational techniques for approximation of counterparty exposure for financial
derivatives are presented. The exposure can be used to quantify so-called Credit Valuation …
derivatives are presented. The exposure can be used to quantify so-called Credit Valuation …
New splitting scheme for pricing American options under the Heston model
M Safaei, A Neisy, N Nematollahi - Computational Economics, 2018 - Springer
In this paper, we present a new splitting scheme for pricing the American options under the
Heston model. For this purpose, first the price of American put option is modeled, which its …
Heston model. For this purpose, first the price of American put option is modeled, which its …
American-type basket option pricing: a simple two-dimensional partial differential equation
H Hanbali, D Linders - Quantitative Finance, 2019 - Taylor & Francis
We consider the pricing of American-type basket derivatives by numerically solving a partial
differential equation (PDE). The curse of dimensionality inherent in basket derivative pricing …
differential equation (PDE). The curse of dimensionality inherent in basket derivative pricing …
Operator splitting schemes for American options under the two-asset Merton jump-diffusion model
L Boen, KJ In't Hout - Applied Numerical Mathematics, 2020 - Elsevier
This paper deals with the efficient numerical solution of the two-dimensional partial integro-
differential complementarity problem (PIDCP) that holds for the value of American-style …
differential complementarity problem (PIDCP) that holds for the value of American-style …
AMF-type W-methods for parabolic problems with mixed derivatives
The time integration of differential equations obtained by the space discretization via finite
differences of evolution parabolic PDEs with mixed derivatives in the elliptic operator is …
differences of evolution parabolic PDEs with mixed derivatives in the elliptic operator is …
Reduced order models for pricing European and American options under stochastic volatility and jump-diffusion models
M Balajewicz, J Toivanen - Journal of Computational Science, 2017 - Elsevier
European options can be priced by solving parabolic partial (-integro) differential equations
under stochastic volatility and jump-diffusion models like the Heston, Merton, and Bates …
under stochastic volatility and jump-diffusion models like the Heston, Merton, and Bates …
A new approach for American option pricing: the dynamic Chebyshev method
K Glau, M Mahlstedt, C Pötz - SIAM Journal on Scientific Computing, 2019 - SIAM
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 …
each step of a dynamic programming time-stepping we approximate the value function with …