NAG Library Routine Document

Integer, Intent (In)	::	ldx, num, ip, iq, nreg, mn, npar, ldcovr, maxit, lwork
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	yt(num), x(ldx,*), tol
Real (Kind=nag_wp), Intent (Inout)	::	theta(npar), covr(ldcovr,npar), hp
Real (Kind=nag_wp), Intent (Out)	::	se(npar), sc(npar), et(num), ht(num), lgf, work(lwork)
Logical, Intent (In)	::	copts(2)
Character (1), Intent (In)	::	dist

C Header Interface

#include <nagmk26.h>

void

g13fef_ (const char *dist, const double yt[], const double x[], const Integer *ldx, const Integer *num, const Integer *ip, const Integer *iq, const Integer *nreg, const Integer *mn, const Integer *npar, double theta[], double se[], double sc[], double covr[], const Integer *ldcovr, double *hp, double et[], double ht[], double *lgf, const logical copts[], const Integer *maxit, const double *tol, double work[], const Integer *lwork, Integer *ifail, const Charlen length_dist)

3

Description

A univariate regression-GJR

GARCH (p, q)

process, with

q

coefficients

α_{i}

, for

i = 1, 2, \dots, q

p

coefficients

β_{i}

, for

i = 1, 2, \dots, p

, and

k

linear regression coefficients

b_{i}

, for

i = 1, 2, \dots, k

, can be represented by:

y_{t} = b_{o} + x_{t}^{T} b + ε_{t}

(1)

h_{t} = α_{0} + \sum_{i = 1}^{q} (α_{i} + γ I_{t - i}) ε_{t - i}^{2} + \sum_{i = 1}^{p} β_{i} h_{t - i}, t = 1, 2, \dots, T

(2)

where

I_{t} = 1

, if

ε_{t} < 0

I_{t} = 0

, if

ε_{t} \geq 0

, and

ε_{t} ∣ ψ_{t - 1} = N (0, h_{t})

ε_{t} ∣ ψ_{t - 1} = S_{t} (df, h_{t})

. Here

S_{t}

is a standardized Student's

t

-distribution with

df

degrees of freedom and variance

h_{t}

T

is the number of terms in the sequence,

y_{t}

denotes the endogenous variables,

x_{t}

the exogenous variables,

b_{o}

the regression mean,

b

the regression coefficients,

ε_{t}

the residuals,

h_{t}

is the conditional variance, and

ψ_{t}

the set of all information up to time

t

g13fef provides an estimate for

\hat{θ}

, the parameter vector

θ = (b_{o}, b^{T}, ω^{T})

where

b^{T} = (b_{1}, \dots, b_{k})

ω^{T} = (α_{0}, α_{1}, \dots, α_{q}, β_{1}, \dots, β_{p}, γ)

when

dist ='N'

and

ω^{T} = (α_{0}, α_{1}, \dots, α_{q}, β_{1}, \dots, β_{p}, γ, df)

when

dist ='T'

mn, nreg can be used to simplify the

GARCH (p, q)

expression in (1) as follows:

No Regression and No Mean

$y_{t} = ε_{t}$ ,
$mn = 0$ ,
$nreg = 0$ and
$θ$ is a $(p + q + 2)$ vector when $dist ='N'$ , and a $(p + q + 3)$ vector when $dist ='T'$ .

No Regression

$y_{t} = b_{o} + ε_{t}$ ,
$mn = 1$ ,
$nreg = 0$ and
$θ$ is a $(p + q + 3)$ vector when $dist ='N'$ , and a $(p + q + 4)$ vector when $dist ='T'$ .

Note: if the

y_{t} = μ + ε_{t}

, where

μ

is known (not to be estimated by g13fef) then (1) can be written as

y_{t}^{μ} = ε_{t}

, where

y_{t}^{μ} = y_{t} - μ

. This corresponds to the case No Regression and No Mean, with

y_{t}

replaced by

y_{t} - μ

No Mean

$y_{t} = x_{t}^{T} b + ε_{t}$ ,
$mn = 0$ ,
$nreg = k$ and
$θ$ is a $(p + q + k + 2)$ vector when $dist ='N'$ , and a $(p + q + k + 3)$ vector when $dist ='T'$ .

4

References

Bollerslev T (1986) Generalised autoregressive conditional heteroskedasticity Journal of Econometrics 31 307–327

Engle R (1982) Autoregressive conditional heteroskedasticity with estimates of the variance of United Kingdom inflation Econometrica 50 987–1008

Engle R and Ng V (1993) Measuring and testing the impact of news on volatility Journal of Finance 48 1749–1777

Glosten L, Jagannathan R and Runkle D (1993) Relationship between the expected value and the volatility of nominal excess return on stocks Journal of Finance 48 1779–1801

Hamilton J (1994) Time Series Analysis Princeton University Press

5

Arguments

1: $dist$ – Character(1)Input

On entry: the type of distribution to use for

e_{t}

$dist ='N'$: A Normal distribution is used.
$dist ='T'$: A Student's $t$ -distribution is used.

Constraint:

dist ='N'

'T'

2: $yt (num)$ – Real (Kind=nag_wp) arrayInput

On entry: the sequence of observations,

y_{t}

, for

t = 1, 2, \dots, T

3: $x (ldx *)$ – Real (Kind=nag_wp) arrayInput

Note: the second dimension of the array x must be at least

nreg

On entry: row

t

of x must contain the time dependent exogenous vector

x_{t}

, where

x_{t}^{T} = (x_{t}^{1}, \dots, x_{t}^{k})

, for

t = 1, 2, \dots, T

4: $ldx$ – IntegerInput

On entry: the first dimension of the array x as declared in the (sub)program from which g13fef is called.

Constraint:

ldx \geq num

5: $num$ – IntegerInput

On entry:

T

, the number of terms in the sequence.

Constraints:

$num \geq \max (ip, iq)$ ;
$num \geq nreg + mn$ .

6: $ip$ – IntegerInput

On entry: the number of coefficients,

β_{i}

, for

i = 1, 2, \dots, p

Constraint:

ip \geq 0

(see also npar).

7: $iq$ – IntegerInput

On entry: the number of coefficients,

α_{i}

, for

i = 1, 2, \dots, q

Constraint:

iq \geq 1

(see also npar).

8: $nreg$ – IntegerInput

On entry:

k

, the number of regression coefficients.

Constraint:

nreg \geq 0

(see also npar).

9: $mn$ – IntegerInput

On entry: if

mn = 1

, the mean term

b_{0}

will be included in the model.

Constraint:

mn = 0

1

10: $npar$ – IntegerInput

On entry: the number of parameters to be included in the model.

npar = 2 + iq + ip + mn + nreg

when

dist ='N'

and

npar = 3 + iq + ip + mn + nreg

when

dist ='T'

Constraint:

npar < 20

11: $theta (npar)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: the initial parameter estimates for the vector

θ

The first element must contain the coefficient

α_{o}

and the next iq elements contain the coefficients

α_{i}

, for

i = 1, 2, \dots, q

The next ip elements must contain the coefficients

β_{j}

, for

j = 1, 2, \dots, p

The next element must contain the asymmetry parameter

γ

dist ='T'

, the next element contains

df

, the number of degrees of freedom of the Student's

t

-distribution.

mn = 1

, the next element must contain the mean term

b_{o}

copts (2) = .FALSE.

, the remaining nreg elements are taken as initial estimates of the linear regression coefficients

b_{i}

, for

i = 1, 2, \dots, k

On exit: the estimated values

\hat{θ}

for the vector

θ

The first element contains the coefficient

α_{o}

, the next iq elements contain the coefficients

α_{i}

, for

i = 1, 2, \dots, q

The next ip elements are the moving average coefficients

β_{j}

, for

j = 1, 2, \dots, p

The next element contains the estimate for the asymmetry parameter

γ

dist ='T'

, the next element contains an estimate for

df

, the number of degrees of freedom of the Student's

t

-distribution.

mn = 1

, the next element contains an estimate for the mean term

b_{o}

The final nreg elements are the estimated linear regression coefficients

b_{i}

, for

i = 1, 2, \dots, k

12: $se (npar)$ – Real (Kind=nag_wp) arrayOutput

On exit: the standard errors for

\hat{θ}

The first element contains the standard error for

α_{o}

and the next iq elements contain the standard errors for

α_{i}

, for

i = 1, 2, \dots, q

The next ip elements are the standard errors for

β_{j}

, for

j = 1, 2, \dots, p

The next element contains the standard error for

γ

dist ='T'

, the next element contains the standard error for

df

, the number of degrees of freedom of the Student's

t

-distribution.

mn = 1

, the next element contains the standard error for

b_{o}

The final nreg elements are the standard errors for

b_{j}

, for

j = 1, 2, \dots, k

13: $sc (npar)$ – Real (Kind=nag_wp) arrayOutput

On exit: the scores for

\hat{θ}

The first element contains the score for

α_{o}

, the next iq elements contain the scores for

α_{i}

, for

i = 1, 2, \dots, q

The next ip elements are the score for

β_{j}

, for

j = 1, 2, \dots, p

The next element contains the score for

γ

dist ='T'

, the next element contains the score for

df

, the number of degrees of freedom of the Student's

t

-distribution.

mn = 1

, the next element contains the score for

b_{o}

The final nreg elements are the scores for

b_{j}

, for

j = 1, 2, \dots, k

14: $covr (ldcovr, npar)$ – Real (Kind=nag_wp) arrayOutput

On exit: the covariance matrix of the parameter estimates

\hat{θ}

, that is the inverse of the Fisher Information Matrix.

15: $ldcovr$ – IntegerInput

On entry: the first dimension of the array covr as declared in the (sub)program from which g13fef is called.

Constraint:

ldcovr \geq npar

16: $hp$ – Real (Kind=nag_wp)Input/Output

On entry: if

copts (2) = .FALSE.

, hp is the value to be used for the pre-observed conditional variance; otherwise hp is not referenced.

On exit: if

copts (2) = .TRUE.

, hp is the estimated value of the pre-observed conditional variance.

17: $et (num)$ – Real (Kind=nag_wp) arrayOutput

On exit: the estimated residuals,

ε_{t}

, for

t = 1, 2, \dots, T

18: $ht (num)$ – Real (Kind=nag_wp) arrayOutput

On exit: the estimated conditional variances,

h_{t}

, for

t = 1, 2, \dots, T

19: $lgf$ – Real (Kind=nag_wp)Output

On exit: the value of the log-likelihood function at

\hat{θ}

20: $copts (2)$ – Logical arrayInput

On entry: the options to be used by g13fef.

$copts (1) = .TRUE.$: Stationary conditions are enforced, otherwise they are not.
$copts (2) = .TRUE.$: The routine provides initial parameter estimates of the regression terms, otherwise these are to be provided by you.

21: $maxit$ – IntegerInput

On entry: the maximum number of iterations to be used by the optimization routine when estimating the

GARCH (p, q)

parameters. If maxit is set to

0

, the standard errors, score vector and variance-covariance are calculated for the input value of

θ

in theta when

dist ='N'

; however the value of

θ

is not updated.

Constraint:

maxit \geq 0

22: $tol$ – Real (Kind=nag_wp)Input

On entry: the tolerance to be used by the optimization routine when estimating the

GARCH (p, q)

parameters.

23: $work (lwork)$ – Real (Kind=nag_wp) arrayWorkspace

24: $lwork$ – IntegerInput

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

Constraint:

lwork \geq (nreg + 3) \times num + npar + 403

25: $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, because for this routine the values of the output arguments may be useful even if

ifail \neq 0

on exit, the recommended value is

- 1

. 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).

Note: g13fef may return useful information for one or more of the following detected errors or warnings.

Errors or warnings detected by the routine:

$ifail = 1$: On entry, $dist = 〈value〉$ .
Constraint: $dist ='N'$ or $'T'$ .

On entry, $ip = 〈value〉$ .
Constraint: $ip \geq 0$ .

On entry, $iq = 〈value〉$ .
Constraint: $iq \geq 1$ .

On entry, $ldcovr = 〈value〉$ .
Constraint: $ldcovr \geq npar$ .

On entry, $ldx = 〈value〉$ .
Constraint: $ldx \geq num$ .

On entry, $maxit = 〈value〉$ .
Constraint: $maxit \geq 0$ .

On entry, $mn = 〈value〉$ .
Constraint: $mn = 0$ or $1$ .

On entry, $npar = 〈value〉$ .
Constraint: if $dist ='N'$ then $npar = 2 + iq + ip + mn + nreg$ , else $npar = 3 + iq + ip + mn + nreg$ .

On entry, $npar = 〈value〉$ .
Constraint: $npar < 20$ .

On entry, $nreg = 〈value〉$ .
Constraint: $nreg \geq 0$ .

On entry, $num = 〈value〉$ .
Constraint: $\max (ip, iq) \leq num$ .

On entry, $num = 〈value〉$ .
Constraint: $num \geq nreg + mn$ .

$ifail = 2$: On entry, $lwork = 〈value〉$ .
Constraint: $lwork \geq (nreg + 3) \times num + npar + 403$ .

$ifail = 3$: On entry, the matrix $X$ is not full rank.

$ifail = 4$: The information matrix is not positive definite.

$ifail = 5$: The maximum number of iterations has been reached.

$ifail = 6$: The log-likelihood cannot be optimized any further.

$ifail = 7$: No feasible model parameters could be found.

$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

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

g13fef 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

None.

10

Example

This example fits a

GARCH (1, 1)

model with Student's

t

-distributed residuals to some simulated data.

The process parameter estimates,

\hat{θ}

, are obtained using g13fef, and a four step ahead volatility estimate is computed using g13fff.

The data was simulated using g05pff.

NAG Library Routine Document

g13fef (uni_garch_gjr_estim)

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