Integer, Intent (In)	::	ntimes
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	t0, tend, times(ntimes)
Real (Kind=nag_wp), Intent (Out)	::	rcomm(12*(ntimes+1))

C Header Interface

#include <nag.h>

void	g05xaf_ (const double t0, const double tend, const double times[], const Integer ntimes, double rcomm[], Integer ifail)

The routine may be called by the names g05xaf or nagf_rand_bb_init.

3 Description

3.1 Brownian Bridge Algorithm

Details on the Brownian bridge algorithm and the Brownian bridge process (sometimes also called a non-free Wiener process) can be found in Section 2.6 in the G05 Chapter Introduction. We briefly recall some notation and definitions.

Fix two times

t_{0} < T

and let

{(t_{i})}_{1 \leq i \leq N}

be any set of time points satisfying

t_{0} < t_{1} < t_{2} <\dots< t_{N} < T

. Let

{(X_{t_{i}})}_{1 \leq i \leq N}

denote a

d

-dimensional Wiener sample path at these time points, and let

C

be any

d

d

matrix such that

C C^{T}

is the desired covariance structure for the Wiener process. Each point

X_{t_{i}}

of the sample path is constructed according to the Brownian bridge interpolation algorithm (see Glasserman (2004) or Section 2.6 in the G05 Chapter Introduction). We always start at some fixed point

X_{t_{0}} = x \in ℝ^{d}

. If we set

X_{T} = x + C \sqrt{T - t_{0}} Z

where

Z

is any

d

-dimensional standard Normal random variable, then

X

will behave like a normal (free) Wiener process. However if we fix the terminal value

X_{T} = w \in ℝ^{d}

, then

X

will behave like a non-free Wiener process.

3.2 Implementation

Given the start and end points of the process, the order in which successive interpolation times

t_{j}

are chosen is called the bridge construction order. The construction order is given by the array times. Further information on construction orders is given in Section 2.6.2 in the G05 Chapter Introduction. For clarity we consider here the common scenario where the Brownian bridge algorithm is used with quasi-random points. If pseudorandom numbers are used instead, these details can be ignored.

Suppose we require

P

Wiener sample paths each of dimension

d

. The main input to the Brownian bridge algorithm is then an array of quasi-random points

Z^{1}, Z^{2},\dots, Z^{P}

where each point

Z^{p} = (Z_{1}^{p}, Z_{2}^{p}, \dots, Z_{D}^{p})

has dimension

D = d (N + 1)

D = d N

respectively, depending on whether a free or non-free Wiener process is required. When g05xbf is called, the

p

th sample path for

1 \leq p \leq P

is constructed as follows: if a non-free Wiener process is required set

X_{T}

equal to the terminal value

w

, otherwise construct

X_{T}

X_{T} = X_{t_{0}} + C \sqrt{T - t_{0}} [\begin{matrix} Z_{1}^{p} \\ ⋮ \\ Z_{d}^{p} \end{matrix}]

where

C

is the matrix described in Section 3.1. The array times holds the remaining time points

t_{1}, t_{2},\dots t_{N}

in the order in which the bridge is to be constructed. For each

j = 1,\dots, N

set

r = times (j)

, find

q = max \{t_{0}, times (i) : 1 \leq i < j, times (i) < r\}

and

s = min \{T, times (i) : 1 \leq i < j, times (i) > r\}

and construct the point

X_{r}

X_{r} = \frac{X_{q} (s - r) + X_{s} (r - q)}{s - q} + C \sqrt{\frac{(s - r) (r - q)}{(s - q)}} [\begin{matrix} Z_{j d - a d + 1}^{p} \\ ⋮ \\ Z_{j d - a d + d}^{p} \end{matrix}]

where

a = 0

a = 1

respectively depending on whether a free or non-free Wiener process is required. Note that in our discussion

j

is indexed from

1

, and so

X_{r}

is interpolated between the nearest (in time) Wiener points which have already been constructed. The routine g05xef can be used to initialize the times array for several predefined bridge construction orders.

4 References

Glasserman P (2004) Monte Carlo Methods in Financial Engineering Springer

5 Arguments

1: $t0$ – Real (Kind=nag_wp) Input

On entry: the starting value

t_{0}

of the time interval.

2: $tend$ – Real (Kind=nag_wp) Input

On entry: the end value

T

of the time interval.

Constraint:

tend > t0

3: $times (ntimes)$ – Real (Kind=nag_wp) array Input

On entry: the points in the time interval

(t_{0}, T)

at which the Wiener process is to be constructed. The order in which points are listed in times determines the bridge construction order. The routine g05xef can be used to create predefined bridge construction orders from a set of input times.

Constraints:

$t0 < times (i) < tend$ , for $i = 1, 2, \dots, ntimes$ ;
$times (i) \neq times (j)$ , for $i, j = 1, 2, \dots ntimes$ and $i \neq j$ .

4: $ntimes$ – Integer Input

On entry: the length of times, denoted by

N

in Section 3.1.

Constraint:

ntimes \geq 1

5: $rcomm (12 \times (ntimes + 1))$ – Real (Kind=nag_wp) array Communication Array

On exit: communication array, used to store information between calls to g05xbf. This array must not be directly modified.

6: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

- 1

1

to set behaviour on detection of an error; these values have no effect when no error is detected.

A value of

0

causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of

- 1

means that an error message is printed while a value of

1

means that it is not.

If halting is not appropriate, the value

- 1

1

is recommended. If message printing is undesirable, then the value

1

is recommended. Otherwise, the value

0

is recommended. When the value $- 1$ or $1$ is used it is essential to test the value of ifail on exit.

On exit:

ifail = 0

unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

If on entry

ifail = 0

- 1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail = 1$: On entry, $tend = 〈value〉$ and $t0 = 〈value〉$ .
Constraint: $tend > t0$ .

$ifail = 2$: On entry, $ntimes = 〈value〉$ .
Constraint: $ntimes \geq 1$ .

$ifail = 3$: On entry, $times (〈value〉) = 〈value〉$ , $t0 = 〈value〉$ and $tend = 〈value〉$ .
Constraint: $t0 < times (i) < tend$ for all $i$ .

$ifail = 4$: On entry, $times (〈value〉)$ and $times (〈value〉)$ both equal $〈value〉$ .
Constraint: all elements of times must be unique.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

Not applicable.

8 Parallelism and Performance

g05xaf is not threaded in any implementation.

9 Further Comments

The efficient implementation of a Brownian bridge algorithm requires the use of a workspace array called the working stack. Since previously computed points will be used to interpolate new points, they should be kept close to the hardware processing units so that the data can be accessed quickly. Ideally the whole stack should be held in hardware cache. Different bridge construction orders may require different amounts of working stack. Indeed, a naive bridge algorithm may require a stack of size

\frac{N}{4}

or even

\frac{N}{2}

, which could be very inefficient when

N

is large. g05xaf performs a detailed analysis of the bridge construction order specified by times. Heuristics are used to find an execution strategy which requires a small working stack, while still constructing the bridge in the order required.

10 Example

This example calls g05xaf, g05xbf and g05xef to generate two sample paths of a three-dimensional free Wiener process. Pseudorandom variates are used to construct the sample paths.

See Section 10 in g05xbf and g05xef for additional examples.