Time-Dependent Barrier Options and Boundary Crossing Probabilities

2003 ◽  
Vol 10 (2) ◽  
pp. 325-334
Author(s):  
A. Novikov ◽  
V. Frishling ◽  
N. Kordzakhia

Abstract The problem of pricing of time-dependent barrier options is considered in the case when interest rate and volatility are given functions in Black–Scholes framework. The calculation of the fair price reduces to the calculation of non-linear boundary crossing probabilities for a standard Brownian motion. The proposed method is based on a piecewise-linear approximation for the boundary and repeated integration. The numerical example provided draws attention to the performance of suggested method in comparison to some alternatives.

1997 ◽  
Vol 34 (1) ◽  
pp. 54-65 ◽  
Author(s):  
Liqun Wang ◽  
Klaus Pötzelberger

An explicit formula for the probability that a Brownian motion crosses a piecewise linear boundary in a finite time interval is derived. This formula is used to obtain approximations to the crossing probabilities for general boundaries which are the uniform limits of piecewise linear functions. The rules for assessing the accuracies of the approximations are given. The calculations of the crossing probabilities are easily carried out through Monte Carlo methods. Some numerical examples are provided.


1997 ◽  
Vol 34 (01) ◽  
pp. 54-65 ◽  
Author(s):  
Liqun Wang ◽  
Klaus Pötzelberger

An explicit formula for the probability that a Brownian motion crosses a piecewise linear boundary in a finite time interval is derived. This formula is used to obtain approximations to the crossing probabilities for general boundaries which are the uniform limits of piecewise linear functions. The rules for assessing the accuracies of the approximations are given. The calculations of the crossing probabilities are easily carried out through Monte Carlo methods. Some numerical examples are provided.


1999 ◽  
Vol 36 (4) ◽  
pp. 1019-1030 ◽  
Author(s):  
Alex Novikov ◽  
Volf Frishling ◽  
Nino Kordzakhia

Using the Girsanov transformation we derive estimates for the accuracy of piecewise approximations for one-sided and two-sided boundary crossing probabilities. We demonstrate that piecewise linear approximations can be calculated using repeated numerical integration. As an illustrative example we consider the case of one-sided and two-sided square-root boundaries for which we also present analytical representations in a form of infinite power series.


2005 ◽  
Vol 42 (1) ◽  
pp. 82-92 ◽  
Author(s):  
K. Borovkov ◽  
A. Novikov

We give explicit upper bounds for convergence rates when approximating both one- and two-sided general curvilinear boundary crossing probabilities for the Wiener process by similar probabilities for close boundaries of simpler form, for which computation of the boundary crossing probabilities is feasible. In particular, we partially generalize and improve results obtained by Pötzelberger and Wang in the case when the approximating boundaries are piecewise linear. Applications to barrier option pricing are also discussed.


2005 ◽  
Vol 42 (01) ◽  
pp. 82-92 ◽  
Author(s):  
K. Borovkov ◽  
A. Novikov

We give explicit upper bounds for convergence rates when approximating both one- and two-sided general curvilinear boundary crossing probabilities for the Wiener process by similar probabilities for close boundaries of simpler form, for which computation of the boundary crossing probabilities is feasible. In particular, we partially generalize and improve results obtained by Pötzelberger and Wang in the case when the approximating boundaries are piecewise linear. Applications to barrier option pricing are also discussed.


2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Yuzi Jin ◽  
Jian Wang ◽  
Sangkwon Kim ◽  
Youngjin Heo ◽  
Changwoo Yoo ◽  
...  

We propose a simple and robust numerical algorithm to estimate a time-dependent volatility function from a set of market observations, using the Black–Scholes (BS) model. We employ a fully implicit finite difference method to solve the BS equation numerically. To define the time-dependent volatility function, we define a cost function that is the sum of the squared errors between the market values and the theoretical values obtained by the BS model using the time-dependent volatility function. To minimize the cost function, we employ the steepest descent method. However, in general, volatility functions for minimizing the cost function are nonunique. To resolve this problem, we propose a predictor-corrector technique. As the first step, we construct the volatility function as a constant. Then, in the next step, our algorithm follows the prediction step and correction step at half-backward time level. The constructed volatility function is continuous and piecewise linear with respect to the time variable. We demonstrate the ability of the proposed algorithm to reconstruct time-dependent volatility functions using manufactured volatility functions. We also present some numerical results for real market data using the proposed volatility function reconstruction algorithm.


1999 ◽  
Vol 36 (04) ◽  
pp. 1019-1030 ◽  
Author(s):  
Alex Novikov ◽  
Volf Frishling ◽  
Nino Kordzakhia

Using the Girsanov transformation we derive estimates for the accuracy of piecewise approximations for one-sided and two-sided boundary crossing probabilities. We demonstrate that piecewise linear approximations can be calculated using repeated numerical integration. As an illustrative example we consider the case of one-sided and two-sided square-root boundaries for which we also present analytical representations in a form of infinite power series.


2001 ◽  
Vol 38 (1) ◽  
pp. 152-164 ◽  
Author(s):  
Klaus Pötzelberger ◽  
Liqun Wang

Wang and Pötzelberger (1997) derived an explicit formula for the probability that a Brownian motion crosses a one-sided piecewise linear boundary and used this formula to approximate the boundary crossing probability for general nonlinear boundaries. The present paper gives a sharper asymptotic upper bound of the approximation error for the formula, and generalizes the results to two-sided boundaries. Numerical computations are easily carried out using the Monte Carlo simulation method. A rule is proposed for choosing optimal nodes for the approximating piecewise linear boundaries, so that the corresponding approximation errors of boundary crossing probabilities converge to zero at a rate of O(1/n2).


Sign in / Sign up

Export Citation Format

Share Document