24.11.2012 Views

Barrier Options and Lumpy Dividends

Barrier Options and Lumpy Dividends

Barrier Options and Lumpy Dividends

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

price<br />

2.5<br />

2<br />

1.5<br />

1<br />

0.5<br />

0<br />

94 95 96 97 98 99 100 101 102 103<br />

Figure 3: The price of the down-<strong>and</strong>-out call option for dividends D1 = D2 = 1 paid<br />

at times τ1 = T /3 <strong>and</strong> τ2 = 2T/3, computed by using the approximative numerical<br />

integration method (solid) <strong>and</strong> the Crank-Nicolson scheme (dashed) with very small step<br />

sizes.<br />

<strong>and</strong> so it only remains to compute P(t,St;K,σ,τ1,τ2) by evaluating one-dimensional<br />

integrals of the function P(τ1,g1(·);K adj<br />

1 ,σ adj<br />

1 ).<br />

For N > 2, we just continue this procedure recursively: at the kth step, k =<br />

S<br />

1,... ,N, compute an approximation of the time-τN−k price P(τN−k,St;K,σ,τN−k+1,... ,τN)<br />

by integrating P(τN−(k−1),g N−(k−1)(·);K adj<br />

k−1 ,σadj<br />

k−1 ). By convention, Kadj 0<br />

σ adj<br />

0 = σ, <strong>and</strong> τ0 = 0. Adjust the strike to<br />

K adj<br />

k := K +<br />

N�<br />

j=k+1<br />

<strong>and</strong> choose the adjusted volatility σ adj<br />

k such that<br />

<strong>and</strong> iterate.<br />

e r(T −τj) Dj = K adj<br />

k−1 + er(T −τk+1) Dk+1<br />

P(τN−k,St;K,σ,τN−k+1,... ,τN) = P(τN−k,St;K adj<br />

k ,σadj<br />

k ),<br />

= K,<br />

Figure 3 compares the price computed with the described approximative method<br />

to the result from the Crank-Nicolson scheme with very small step sizes. We consider<br />

the case N = 2 with dividends D1 = D2 = 1 paid at times τ1 = T/3 <strong>and</strong> τ2 = 2T/3.<br />

The approximation works nicely — relative errors are in the order of 0.1%-1%,<br />

10

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!