void	nag_jumpdiff_merton_price (Nag_OrderType order, Nag_CallPut option, Integer m, Integer n, const double x[], double s, const double t[], double sigma, double r, double lambda, double jvol, double p[], NagError *fail)

3

Description

nag_jumpdiff_merton_price (s30jac) uses Merton's jump-diffusion model (Merton (1976)) to compute the price of a European option. This assumes that the asset price is described by a Brownian motion with drift, as in the Black–Scholes–Merton case, together with a compound Poisson process to model the jumps. The corresponding stochastic differential equation is,

\frac{d S}{S} = (α - λ k) d t + \hat{σ} {d W}_{t} + {d q}_{t} .

Here

α

is the instantaneous expected return on the asset price,

S

;

{\hat{σ}}^{2}

is the instantaneous variance of the return when the Poisson event does not occur;

{d W}_{t}

is a standard Brownian motion;

q_{t}

is the independent Poisson process and

k = E [Y - 1]

where

Y - 1

is the random variable change in the stock price if the Poisson event occurs and

E

is the expectation operator over the random variable

Y

This leads to the following price for a European option (see Haug (2007))

P_{call} = \sum_{j = 0}^{\infty} \frac{e^{- λ T} {(λ T)}^{j}}{j!} C_{j} (S, X, T, r, σ_{j}^{'}),

where

T

is the time to expiry;

X

is the strike price;

r

is the annual risk-free interest rate;

C_{j} (S, X, T, r, σ_{j}^{'})

is the Black–Scholes–Merton option pricing formula for a European call (see nag_bsm_price (s30aac)).

\begin{array}{l} σ_{j}^{'} = \sqrt{z^{2} + δ^{2} (\frac{j}{T})}, \\ z^{2} = σ^{2} - λ δ^{2}, \\ δ^{2} = \frac{γ σ^{2}}{λ}, \end{array}

where

σ

is the total volatility including jumps;

λ

is the expected number of jumps given as an average per year;

γ

is the proportion of the total volatility due to jumps.

The value of a put is obtained by substituting the Black–Scholes–Merton put price for

C_{j} (S, X, T, r, σ_{j}^{'})

The option price

P_{i j} = P (X = X_{i}, T = T_{j})

is computed for each strike price in a set

X_{i}

i = 1, 2, \dots, m

, and for each expiry time in a set

T_{j}

j = 1, 2, \dots, n

4

References

Haug E G (2007) The Complete Guide to Option Pricing Formulas (2nd Edition) McGraw-Hill

Merton R C (1976) Option pricing when underlying stock returns are discontinuous Journal of Financial Economics 3 125–144

5

Arguments

1: $order$ – Nag_OrderTypeInput

On entry: the order argument specifies the two-dimensional storage scheme being used, i.e., row-major ordering or column-major ordering. C language defined storage is specified by

order = Nag_RowMajor

. See Section 3.3.1.3 in How to Use the NAG Library and its Documentation for a more detailed explanation of the use of this argument.

Constraint:

order = Nag_RowMajor

Nag_ColMajor

2: $option$ – Nag_CallPutInput

On entry: determines whether the option is a call or a put.

$option = Nag_Call$: A call; the holder has a right to buy.
$option = Nag_Put$: A put; the holder has a right to sell.

Constraint:

option = Nag_Call

Nag_Put

3: $m$ – IntegerInput

On entry: the number of strike prices to be used.

Constraint:

m \geq 1

4: $n$ – IntegerInput

On entry: the number of times to expiry to be used.

Constraint:

n \geq 1

5: $x [m]$ – const doubleInput

On entry:

x [i - 1]

must contain

X_{i}

, the

i

th strike price, for

i = 1, 2, \dots, m

Constraint:

x [i - 1] \geq z ​ and ​ x [i - 1] \leq 1 / z

, where

z = nag_real_safe_small_number

, the safe range parameter, for

i = 1, 2, \dots, m

6: $s$ – doubleInput

On entry:

S

, the price of the underlying asset.

Constraint:

s \geq z ​ and ​ s \leq 1.0 / z

, where

z = nag_real_safe_small_number

, the safe range parameter.

7: $t [n]$ – const doubleInput

On entry:

t [i - 1]

must contain

T_{i}

, the

i

th time, in years, to expiry, for

i = 1, 2, \dots, n

Constraint:

t [i - 1] \geq z

, where

z = nag_real_safe_small_number

, the safe range parameter, for

i = 1, 2, \dots, n

8: $sigma$ – doubleInput

On entry:

σ

, the annual total volatility, including jumps.

Constraint:

sigma > 0.0

9: $r$ – doubleInput

On entry:

r

, the annual risk-free interest rate, continuously compounded. Note that a rate of 5% should be entered as 0.05.

Constraint:

r \geq 0.0

10: $lambda$ – doubleInput

On entry:

λ

, the number of expected jumps per year.

Constraint:

lambda > 0.0

11: $jvol$ – doubleInput

On entry: the proportion of the total volatility associated with jumps.

Constraint:

0.0 \leq jvol < 1.0

12: $p [m \times n]$ – doubleOutput

Note: where

P (i, j)

appears in this document, it refers to the array element

$p [(j - 1) \times m + i - 1]$ when $order = Nag_ColMajor$ ;
$p [(i - 1) \times n + j - 1]$ when $order = Nag_RowMajor$ .

On exit:

P (i, j)

contains

P_{i j}

, the option price evaluated for the strike price

x_{i}

at expiry

t_{j}

for

i = 1, 2, \dots, m

and

j = 1, 2, \dots, n

13: $fail$ – NagError *Input/Output

The NAG error argument (see Section 3.7 in How to Use the NAG Library and its Documentation).

6

Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
See Section 2.3.1.2 in How to Use the NAG Library and its Documentation for further information.
NE_BAD_PARAM: On entry, argument $〈value〉$ had an illegal value.
NE_INT: On entry, $m = 〈value〉$ .
Constraint: $m \geq 1$ .

On entry, $n = 〈value〉$ .
Constraint: $n \geq 1$ .
NE_INTERNAL_ERROR: An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 2.7.6 in How to Use the NAG Library and its Documentation for further information.
NE_NO_LICENCE: Your licence key may have expired or may not have been installed correctly.
See Section 2.7.5 in How to Use the NAG Library and its Documentation for further information.
NE_REAL: On entry, $jvol = 〈value〉$ .
Constraint: $jvol \geq 0.0$ and $jvol < 1.0$ .

On entry, $lambda = 〈value〉$ .
Constraint: $lambda > 0.0$ .

On entry, $r = 〈value〉$ .
Constraint: $r \geq 0.0$ .

On entry, $s = 〈value〉$ .
Constraint: $s \geq 〈value〉$ and $s \leq 〈value〉$ .

On entry, $sigma = 〈value〉$ .
Constraint: $sigma > 0.0$ .
NE_REAL_ARRAY: On entry, $t [〈value〉] = 〈value〉$ .
Constraint: $t [i] \geq 〈value〉$ .

On entry, $x [〈value〉] = 〈value〉$ .
Constraint: $x [i] \geq 〈value〉$ and $x [i] \leq 〈value〉$ .

7

Accuracy

The accuracy of the output is dependent on the accuracy of the cumulative Normal distribution function,

Φ

, occurring in

C_{j}

. This is evaluated using a rational Chebyshev expansion, chosen so that the maximum relative error in the expansion is of the order of the machine precision (see nag_cumul_normal (s15abc) and nag_erfc (s15adc)). An accuracy close to machine precision can generally be expected.

8

Parallelism and Performance

nag_jumpdiff_merton_price (s30jac) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

nag_jumpdiff_merton_price (s30jac) makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the x06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this function. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9

Further Comments

None.

10

Example

This example computes the price of a European call with jumps. The time to expiry is

3

months, the stock price is

45

and the strike price is

55

. The number of jumps per year is

3

and the percentage of the total volatility due to jumps is

40 %

. The risk-free interest rate is

10 %

per year and the total volatility is

25 %

per year.

NAG Library Function Document

nag_jumpdiff_merton_price (s30jac)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results