Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNotes on the SWIFT method based on Shannon Wavelets for Option Pricing
89
0
0.0
(
0
)
Authors
Fabien Le Floch
Ask ChatGPT about the research
No Arabic abstract
This note shows that the cosine expansion based on the Vieta formula is equivalent to a discretization of the Parseval identity. We then evaluate the use of simple direct algorithms to compute the Shannon coefficients for the payoff. Finally, we explore the efficiency of a Filon quadrature instead of the Vieta formula for the coefficients related to the probability density function.
rate research
Read More
This paper proposes the sample path generation method for the stochastic volatility version of CGMY process. We present the Monte-Carlo method for European and American option pricing with the sample path generation and calibrate model parameters to the American style S&P 100 index options market, using the least square regression method. Moreover, we discuss path-dependent options such as Asian and Barrier options.
In this article, we show how the scaling symmetry of the SABR model can be utilized to efficiently price European options. For special kinds of payoffs, the complexity of the problem is reduced by one dimension. For more generic payoffs, instead of solving the 1+2 dimensional SABR PDE, it is sufficient to solve $N_V$ uncoupled 1+1 dimensional PDEs, where $N_V$ is the number of points used to discretize one dimension. Furthermore, the symmetry argument enables us to obtain prices of multiple options, whose payoffs are related to each other by convolutions, by valuing one of them. The results of the method are compared with the Monte Carlo simulation.
In this paper we propose two efficient techniques which allow one to compute the price of American basket options. In particular, we consider a basket of assets that follow a multi-dimensional Black-Scholes dynamics. The proposed techniques, called GPR Tree (GRP-Tree) and GPR Exact Integration (GPR-EI), are both based on Machine Learning, exploited together with binomial trees or with a closed formula for integration. Moreover, these two methods solve the backward dynamic programming problem considering a Bermudan approximation of the American option. On the exercise dates, the value of the option is first computed as the maximum between the exercise value and the continuation value and then approximated by means of Gaussian Process Regression. The two methods mainly differ in the approach used to compute the continuation value: a single step of binomial tree or integration according to the probability density of the process. Numerical results show that these two methods are accurate and reliable in handling American options on very large baskets of assets. Moreover we also consider the rough Bergomi model, which provides stochastic volatility with memory. Despite this model is only bidimensional, the whole history of the process impacts on the price, and handling all this information is not obvious at all. To this aim, we present how to adapt the GPR-Tree and GPR-EI methods and we focus on pricing American options in this non-Markovian framework.
The Fourier cosine expansion (COS) method is used for pricing European options numerically very fast. To apply the COS method, a truncation interval for the density of the log-returns need to be provided. Using Markovs inequality, we derive a new formula to obtain the truncation interval and prove that the interval is large enough to ensure convergence of the COS method within a predefined error tolerance. We also show by several examples that the classical approach to determine the truncation interval by cumulants may lead to serious mispricing. Usually, the computational time of the COS method is of similar magnitude in both cases.
We present new numerical schemes for pricing perpetual Bermudan and American options as well as $alpha$-quantile options. This includes a new direct calculation of the optimal exercise barrier for early-exercise options. Our approach is based on the Spitzer identities for general Levy processes and on the Wiener-Hopf method. Our direct calculation of the price of $alpha$-quantile options combines for the first time the Dassios-Port-Wendel identity and the Spitzer identities for the extrema of processes. Our results show that the new pricing methods provide excellent error convergence with respect to computational time when implemented with a range of Levy processes.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
