g05xac initializes the Brownian bridge generator
g05xbc. It must be called before any calls to
g05xbc.
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
${\left({t}_{i}\right)}_{1\le i\le N}$ be any set of time points satisfying
${t}_{0}<{t}_{1}<{t}_{2}<\cdots <{t}_{N}<T$. Let
${\left({X}_{{t}_{i}}\right)}_{1\le i\le N}$ denote a
$d$-dimensional Wiener sample path at these time points, and let
$C$ be any
$d$ by
$d$ matrix such that
$C{C}^{\mathrm{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 {\mathbb{R}}^{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 {\mathbb{R}}^{d}$, then
$X$ will behave like a non-free Wiener process.
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}=\left({Z}_{1}^{p},{Z}_{2}^{p},\dots ,{Z}_{D}^{p}\right)$ has dimension
$D=d\left(N+1\right)$ or
$D=dN$ respectively, depending on whether a free or non-free Wiener process is required. When
g05xbc is called, the
$p$th sample path for
$1\le p\le 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}$ as
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={\mathbf{times}}\left[j-1\right]$, find
and
and construct the point
${X}_{r}$ as
where
$a=0$ or
$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 function
g05xec can be used to initialize the
times array for several predefined bridge construction orders.
Not applicable.
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.
g05xac 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.
This example calls
g05xac,
g05xbc and
g05xec to generate two sample paths of a three-dimensional free Wiener process. Pseudorandom variates are used to construct the sample paths.
None.