Integer, Intent (In)	::	nb, m1, m2, inter(2), ftype, lrcomm
Integer, Intent (Inout)	::	pn, ifail
Real (Kind=nag_wp), Intent (In)	::	t(nb), tau, sinit(*)
Real (Kind=nag_wp), Intent (Inout)	::	ma(nb), p, rcomm(lrcomm)
Real (Kind=nag_wp), Intent (Out)	::	wma(nb)

C Header Interface

#include nagmk26.h

void	g13mgf_ ( const Integer nb, double ma[], const double t[], const double tau, const Integer m1, const Integer m2, const double sinit[], const Integer inter[], const Integer ftype, double p, Integer pn, double wma[], double rcomm[], const Integer lrcomm, Integer *ifail)

3

Description

g13mgf provides a number of operators for an inhomogeneous time series. The time series is represented by two vectors of length

n

; a vector of times,

t

; and a vector of values,

z

. Each element of the time series is therefore composed of the pair of scalar values

(t_{i}, z_{i})

, for

i = 1, 2, \dots, n

. Time

t

can be measured in any arbitrary units, as long as all elements of

t

use the same units.

The main operator available, the moving average (MA), with parameter

τ

is defined as

MA [τ, m_{1}, m_{2}; y] (t_{i}) = \frac{1}{m_{2} - m_{1} + 1} \sum_{j = m_{1}}^{m_{2}} EMA [\tilde{τ}, j; y] (t_{i})

(1)

where

\tilde{τ} = \frac{2 τ}{m_{2} + m_{1}}

m_{1}

and

m_{2}

are user-supplied integers controlling the amount of lag and smoothing respectively, with

m_{2} \geq m_{1}

and

EMA (\cdot)

is the iterated exponential moving average operator.

The iterated exponential moving average,

EMA [\tilde{τ}, m; y] (t_{i})

, is defined using the recursive formula:

EMA [\tilde{τ}, m; y] (t_{i}) = EMA [\tilde{τ}; EMA [\tilde{τ}, m - 1; y] (t_{i})] (t_{i})

with

EMA [\tilde{τ}, 1; y] (t_{i}) = EMA [\tilde{τ}; y] (t_{i})

and

EMA [\tilde{τ}; y] (t_{i}) = μ EMA [\tilde{τ}; y] (t_{i - 1}) + (ν - μ) y_{i - 1} + (1 - ν) y_{i}

where

μ = e^{- α} and α = \frac{t_{i} - t_{i - 1}}{\tilde{τ}} .

The value of

ν

depends on the method of interpolation chosen and the relationship between

y

and the input series

z

depends on the transformation function chosen. g13mgf gives the option of three interpolation methods:

1.	Previous point:	$ν = 1$ .
2.	Linear:	$ν = (1 - μ) / α$ .
3.	Next point:	$ν = μ$ .

and three transformation functions:

1.	Identity:	$y_{i} = {z_{i}}^{[p]}$ .
2.	Absolute value:	$y_{i} = {\|z_{i}\|}^{p}$ .
3.	Absolute difference:	$y_{i} = {\|z_{i} - MA [τ, m_{1}, m_{2}; z] (t_{i})\|}^{p}$ .

where the notation

[p]

is used to denote the integer nearest to

p

. In addition, if either the absolute value or absolute difference transformation are used then the resulting moving average can be scaled by

p^{- 1}

The various parameter options allow a number of different operators to be applied by g13mgf, a few of which are:

(i)

Moving Average (MA), as defined in (1) (obtained by setting

ftype = 1

and

p = 1

(ii)

Moving Norm (MNorm), defined as

MNorm (τ, m, p; z) = {MA [τ, 1, m; {|z|}^{p}]}^{1 / p}

(obtained by setting

ftype = 4

m1 = 1

and

m2 = m

(iii)

Moving Variance (MVar), defined as

MVar (τ, m, p; z) = MA [τ, 1, m; {|z - MA [τ, 1, m; z]|}^{p}]

(obtained by setting

ftype = 3

m1 = 1

and

m2 = m

(iv)

Moving Standard Deviation (MSD), defined as

MSD (τ, m, p; z) = {MA [τ, 1, m; {|z - MA [τ, 1, m; z]|}^{p}]}^{1 / p}

(obtained by setting

ftype = 5

m1 = 1

and

m2 = m

For large datasets or where all the data is not available at the same time,

z

and

t

can be split into arbitrary sized blocks and g13mgf called multiple times.

4

References

Dacorogna M M, Gencay R, Müller U, Olsen R B and Pictet O V (2001) An Introduction to High-frequency Finance Academic Press

Zumbach G O and Müller U A (2001) Operators on inhomogeneous time series International Journal of Theoretical and Applied Finance 4(1) 147–178

5

Arguments

1: $nb$ – IntegerInput

On entry:

b

, the number of observations in the current block of data. At each call the size of the block of data supplied in ma and t can vary; therefore nb can change between calls to g13mgf.

Constraint:

nb \geq 0

2: $ma (nb)$ – Real (Kind=nag_wp) arrayInput/Output

On entry:

z_{i}

, the current block of observations, for

i = k + 1, \dots, k + b

, where

k

is the number of observations processed so far, i.e., the value supplied in pn on entry.

On exit: the moving average:

if $ftype = 4$ or $5$: $ma (i) = {\{MA [τ, m_{1}, m_{2}; y] (t_{i})\}}^{1 / p}$ ,
otherwise: $ma (i) = MA [τ, m_{1}, m_{2}; y] (t_{i})$ .

3: $t (nb)$ – Real (Kind=nag_wp) arrayInput

On entry:

t_{i}

, the times for the current block of observations, for

i = k + 1, \dots, k + b

, where

k

is the number of observations processed so far, i.e., the value supplied in pn on entry.

t_{i} \leq t_{i - 1}

ifail = 31

will be returned, but g13mgf will continue as if

t

was strictly increasing by using the absolute value. The lagged difference,

t_{i} - t_{i - 1}

must be sufficiently small that

e^{- α}

α = (t_{i} - t_{i - 1}) / \tilde{τ}

can be calculated without overflowing, for all

i

4: $tau$ – Real (Kind=nag_wp)Input

On entry:

τ

, the parameter controlling the rate of decay.

τ

must be sufficiently large that

e^{- α}

α = (t_{i} - t_{i - 1}) / \tilde{τ}

can be calculated without overflowing, for all

i

, where

\tilde{τ} = \frac{2 τ}{m_{2} + m_{1}}

Constraint:

tau > 0.0

5: $m1$ – IntegerInput

On entry:

m_{1}

, the iteration of the EMA operator at which the sum is started.

Constraint:

m1 \geq 1

6: $m2$ – IntegerInput

On entry:

m_{2}

, the iteration of the EMA operator at which the sum is ended.

Constraint:

m2 \geq m1

7: $sinit (*)$ – Real (Kind=nag_wp) arrayInput

Note: the dimension of the array sinit must be at least

2 \times m2 + 3

ftype = 3

5

, and at least

m2 + 2

otherwise.

On entry: if

pn = 0

, the values used to start the iterative process, with

$sinit (1) = t_{0}$ ,
$sinit (2) = y_{0}$ ,
$sinit (j + 2) = EMA [τ, j; y] (t_{0})$ , for $i = 1, 2, \dots, m2$ .

In addition, if

ftype = 3

5

then

$sinit (m2 + 3) = z_{0}$ ,
$sinit (m2 + j + 2) = EMA [τ, j; z] (t_{0})$ , for $j = 1, 2, \dots, m2$ .

i.e., initial values based on the original data

z

as opposed to the transformed data

y

pn \neq 0

, sinit is not referenced.

Constraint: if

ftype \neq 1

sinit (j) \geq 0

, for

j = 2, 3, \dots, m2 + 2

8: $inter (2)$ – Integer arrayInput

On entry: the type of interpolation used with

inter (1)

indicating the interpolation method to use when calculating

EMA [τ, 1; z]

and

inter (2)

the interpolation method to use when calculating

EMA [τ, j; z]

j > 1

Three types of interpolation are possible:

$inter (i) = 1$: Previous point, with $ν = 1$ .
$inter (i) = 2$: Linear, with $ν = (1 - μ) / α$ .
$inter (i) = 3$: Next point, $ν = μ$ .

Zumbach and Müller (2001) recommend that linear interpolation is used in second and subsequent iterations, i.e.,

inter (2) = 2

, irrespective of the interpolation method used at the first iteration, i.e., the value of

inter (1)

Constraint:

inter (i) = 1

2

3

, for

i = 1, 2

9: $ftype$ – IntegerInput

On entry: the function type used to define the relationship between

y

and

z

when calculating

EMA [τ, 1; y]

. Three functions are provided:

$ftype = 1$: The identity function, with $y_{i} = {z_{i}}^{[p]}$ .
$ftype = 2$ or $4$: The absolute value, with $y_{i} = {|z_{i}|}^{p}$ .
$ftype = 3$ or $5$: The absolute difference, with $y_{i} = {|z_{i} - MA [τ, m; y] (t_{i})|}^{p}$ .

ftype = 4

5

then the resulting vector of averages is scaled by

p^{- 1}

as described in ma.

Constraint:

ftype = 1

2

3

4

5

10: $p$ – Real (Kind=nag_wp)Input/Output

On entry:

p

, the power used in the transformation function.

On exit: if

ftype = 1

, then

[p]

, the actual power used in the transformation function is returned, otherwise p is unchanged.

Constraint:

p \neq 0

11: $pn$ – IntegerInput/Output

On entry:

k

, the number of observations processed so far. On the first call to g13mgf, or when starting to summarise a new dataset, pn must be set to

0

. On subsequent calls it must be the same value as returned by the last call to g13mgf.

On exit:

k + b

, the updated number of observations processed so far.

Constraint:

pn \geq 0

12: $wma (nb)$ – Real (Kind=nag_wp) arrayOutput

On exit: either the moving average or exponential moving average, depending on the value of ftype.

if $ftype = 3$ or $5$: $wma (i) = MA [τ; y] (t_{i})$
otherwise: $wma (i) = EMA [\tilde{τ}; y] (t_{i})$ .

13: $rcomm (lrcomm)$ – Real (Kind=nag_wp) arrayCommunication Array

On entry: communication array, used to store information between calls to g13mgf. If

lrcomm = 0

, rcomm is not referenced, pn must be set to

0

and all the data must be supplied in one go.

14: $lrcomm$ – IntegerInput

On entry: the dimension of the array rcomm as declared in the (sub)program from which g13mgf is called.

Constraint:

lrcomm = 0

lrcomm \geq 2 \times m2 + 20

15: $ifail$ – IntegerInput/Output

On entry: ifail must be set to

0

- 1 ​ or ​ 1

. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value

- 1 ​ or ​ 1

is recommended. If the output of error messages is undesirable, then the value

1

is recommended. Otherwise, if you are not familiar with this argument, the recommended value is

0

. 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 = 11$: On entry, $nb = 〈value〉$ .
Constraint: $nb \geq 0$ .

$ifail = 31$: On entry, $i = 〈value〉$ , $t (i - 1) = 〈value〉$ and $t (i) = 〈value〉$ .
Constraint: t should be strictly increasing.

$ifail = 32$: On entry, $i = 〈value〉$ , $t (i - 1) = 〈value〉$ and $t (i) = 〈value〉$ .
Constraint: $t (i) \neq t (i - 1)$ if linear interpolation is being used.

$ifail = 41$: On entry, $tau = 〈value〉$ .
Constraint: $tau > 0.0$ .

$ifail = 42$: On entry, $tau = 〈value〉$ .
On entry at previous call, $tau = 〈value〉$ .
Constraint: if $pn > 0$ then tau must be unchanged since previous call.

$ifail = 51$: On entry, $m1 = 〈value〉$ .
Constraint: $m1 \geq 1$ .

$ifail = 52$: On entry, $m1 = 〈value〉$ .
On entry at previous call, $m1 = 〈value〉$ .
Constraint: if $pn > 0$ then m1 must be unchanged since previous call.

$ifail = 61$: On entry, $m1 = 〈value〉$ and $m2 = 〈value〉$ .
Constraint: $m2 \geq m1$ .

$ifail = 62$: On entry, $m2 = 〈value〉$ .
On entry at previous call, $m2 = 〈value〉$ .
Constraint: if $pn > 0$ then m2 must be unchanged since previous call.

$ifail = 71$: On entry, $ftype \neq 1$ , $j = 〈value〉$ and $sinit (j) = 〈value〉$ .
Constraint: if $ftype \neq 1$ , $sinit (j) \geq 0.0$ , for $j = 2, 3, \dots, m2 + 2$ .

$ifail = 81$: On entry, $inter (1) = 〈value〉$ .
Constraint: $inter (1) = 1$ , $2$ or $3$ .

$ifail = 82$: On entry, $inter (2) = 〈value〉$ .
Constraint: $inter (2) = 1$ , $2$ or $3$ .

$ifail = 83$: On entry, $inter (1) = 〈value〉$ and $inter (2) = 〈value〉$ .
On entry at previous call, $inter (1) = 〈value〉$ , $inter (2) = 〈value〉$ .
Constraint: if $pn \neq 0$ , inter must be unchanged since the last call.

$ifail = 91$: On entry, $ftype = 〈value〉$ .
Constraint: $ftype = 1$ , $2$ , $3$ , $4$ or $5$ .

$ifail = 92$: On entry, $ftype = 〈value〉$ , On entry at previous call, $ftype = 〈value〉$ .
Constraint: if $pn \neq 0$ , ftype must be unchanged since the previous call.

$ifail = 101$: On entry, $p = 〈value〉$ .
Constraint: absolute value of p must be representable as an integer.

$ifail = 102$: On entry, $p = 〈value〉$ .
Constraint: if $ftype \neq 1$ , $p \neq 0.0$ . If $ftype = 1$ , the nearest integer to $p$ must not be $0$ .

$ifail = 103$: On entry, $i = 〈value〉$ , $ma (i) = 〈value〉$ and $p = 〈value〉$ .
Constraint: if $ftype = 1$ , $2$ or $4$ and $ma (i) = 0$ for any $i$ then $p > 0.0$ .

$ifail = 104$: On entry, $i = 〈value〉$ , $ma (i) = 〈value〉$ , $wma (i) = 〈value〉$ and $p = 〈value〉$ .
Constraint: if $p < 0.0$ , $ma (i) - wma (i) \neq 0.0$ , for any $i$ .

$ifail = 105$: On entry, $p = 〈value〉$ .
On exit from previous call, $p = 〈value〉$ .
Constraint: if $pn > 0$ then p must be unchanged since previous call.

$ifail = 111$: On entry, $pn = 〈value〉$ .
Constraint: $pn \geq 0$ .

$ifail = 112$: On entry, $pn = 〈value〉$ .
On exit from previous call, $pn = 〈value〉$ .
Constraint: if $pn > 0$ then pn must be unchanged since previous call.

$ifail = 131$: rcomm has been corrupted between calls.

$ifail = 141$: On entry, $pn = 0$ , $lrcomm = 〈value〉$ and $m2 = 〈value〉$ .
Constraint: if $pn = 0$ , $lrcomm = 0$ or $lrcomm \geq 2 m2 + 20$ .

$ifail = 142$: On entry, $pn \neq 0$ , $lrcomm = 〈value〉$ and $m2 = 〈value〉$ .
Constraint: if $pn \neq 0$ , $lrcomm \geq 2 m2 + 20$ .

$ifail = 301$: Truncation occurred to avoid overflow, check for extreme values in t, ma or for tau. Results are returned using the truncated values.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

Not applicable.

8

Parallelism and Performance

g13mgf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

g13mgf 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 routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9

Further Comments

Approximately

4 m_{2}

real elements are internally allocated by g13mgf. If

ftype = 3

5

then a further nb real elements are also allocated.

The more data you supply to g13mgf in one call, i.e., the larger nb is, the more efficient the routine will be, particularly if the routine is being run using more than one thread.

Checks are made during the calculation of

α

and

y_{i}

to avoid overflow. If a potential overflow is detected the offending value is replaced with a large positive or negative value, as appropriate, and the calculations performed based on the replacement values. In such cases

ifail = 301

is returned. This should not occur in standard usage and will only occur if extreme values of ma, t or tau are supplied.

10

Example

The example reads in a simulated time series,

(t, z)

and calculates the moving average. The data is supplied in three blocks of differing sizes.

NAG Library Routine Document

g13mgf (inhom_ma)

▸▿ 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