NAG Library ManualKeyword Search:

NAG Library Routine Document

g13aef (uni_arima_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

g13aef fits a seasonal autoregressive integrated moving average (ARIMA) model to an observed time series, using a nonlinear least squares procedure incorporating backforecasting. Parameter estimates are obtained, together with appropriate standard errors. The residual series is returned, and information for use in forecasting the time series is produced for use by the routines g13agf and g13ahf.

The estimation procedure is iterative, starting with initial parameter values such as may be obtained using g13adf. It continues until a specified convergence criterion is satisfied, or until a specified number of iterations has been carried out. The progress of the procedure can be monitored by means of a user-supplied routine.

2

Specification

Fortran Interface

Subroutine g13aef (

mr, par, npar, c, kfc, x, nx, icount, ex, exr, al, iex, s, g, igh, sd, h, ldh, st, ist, nst, piv, kpiv, nit, itc, zsp, kzsp, isf, wa, iwa, hc, ifail)

Integer, Intent (In)	::	mr(7), npar, kfc, nx, iex, igh, ldh, ist, kpiv, nit, kzsp, iwa
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	icount(6), nst, itc, isf(4)
Real (Kind=nag_wp), Intent (In)	::	x(nx)
Real (Kind=nag_wp), Intent (Inout)	::	par(npar), c, h(ldh,igh), zsp(4), hc(ldh,igh)
Real (Kind=nag_wp), Intent (Out)	::	ex(iex), exr(iex), al(iex), s, g(igh), sd(igh), st(ist), wa(iwa)
External	::	piv

C Header Interface

#include nagmk26.h

void

g13aef_ ( const Integer mr[], double par[], const Integer *npar, double *c, const Integer *kfc, const double x[], const Integer *nx, Integer icount[], double ex[], double exr[], double al[], const Integer *iex, double *s, double g[], const Integer *igh, double sd[], double h[], const Integer *ldh, double st[], const Integer *ist, Integer *nst,
void (NAG_CALL *piv)( const Integer mr[], const double par[], const Integer *npar, const double *c, const Integer *kfc, const Integer icount[], const double *s, const double g[], const double h[], const Integer *ldh, const Integer *igh, const Integer *itc, const double zsp[]),
const Integer *kpiv, const Integer *nit, Integer *itc, double zsp[], const Integer *kzsp, Integer isf[], double wa[], const Integer *iwa, double hc[], Integer *ifail)

3

Description

The time series

x_{1}, x_{2}, \dots, x_{n}

supplied to g13aef is assumed to follow a seasonal autoregressive integrated moving average (ARIMA) model defined as follows:

\nabla^{d} \nabla_{s}^{D} x_{t} - c = w_{t},

where

\nabla^{d} \nabla_{s}^{D} x_{t}

is the result of applying non-seasonal differencing of order

d

and seasonal differencing of seasonality

s

and order

D

to the series

x_{t}

, as outlined in the description of g13aaf. The differenced series is then of length

N = n - d^{'}

, where

d^{'} = d + (D \times s)

is the generalized order of differencing. The scalar

c

is the expected value of the differenced series, and the series

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

follows a zero-mean stationary autoregressive moving average (ARMA) model defined by a pair of recurrence equations. These express

w_{t}

in terms of an uncorrelated series

a_{t}

, via an intermediate series

e_{t}

. The first equation describes the seasonal structure:

w_{t} = Φ_{1} w_{t - s} + Φ_{2} w_{t - 2 \times s} + \dots + Φ_{P} w_{t - P \times s} + e_{t} - Θ_{1} e_{t - s} - Θ_{2} e_{t - 2 \times s} - \dots - Θ_{Q} e_{t - Q \times s} .

The second equation describes the non-seasonal structure. If the model is purely non-seasonal the first equation is redundant and

e_{t}

above is equated with

w_{t}

e_{t} = ϕ_{1} e_{t - 1} + ϕ_{2} e_{t - 2} + \dots + ϕ_{p} e_{t - p} + a_{t} - θ_{1} a_{t - 1} - θ_{2} a_{t - 2} - \dots - θ_{q} a_{t - q} .

Estimates of the model parameters defined by

\begin{array}{l} ϕ_{1}, ϕ_{2}, \dots, ϕ_{p}, θ_{1}, θ_{2}, \dots, θ_{q}, \\ Φ_{1}, Φ_{2}, \dots, Φ_{P}, Θ_{1}, Θ_{2}, \dots, Θ_{Q} \end{array}

and (optionally)

c

are obtained by minimizing a quadratic form in the vector

w = {(w_{1}, w_{2}, \dots, w_{N})}^{'}

This is

Q F = w^{'} V^{- 1} w

, where

V

is the covariance matrix of

w

, and is a function of the model parameters. This matrix is not explicitly evaluated, since

Q F

may be expressed as a ‘sum of squares’ function. When moving average parameters

θ_{i}

Θ_{i}

are present, so that the generalized moving average order

q^{'} = q + s \times Q

is positive, backforecasts

w_{1 - q^{'}}, w_{2 - q^{'}}, \dots, w_{0}

are introduced as nuisance parameters. The ‘sum of squares’ function may then be written as

S (p m) = \sum_{t = 1 - q^{'}}^{N} a_{t}^{2} - \sum_{t = 1 - q^{'} - p^{'}}^{- q^{'}} b_{t}^{2},

where

p m

is a combined vector of parameters, consisting of the backforecasts followed by the ARMA model parameters.

The terms

a_{t}

correspond to the ARMA model residual series

a_{t}

, and

p^{'} = p + s \times P

is the generalized autoregressive order. The terms

b_{t}

are only present if autoregressive parameters are in the model, and serve to correct for transient errors introduced at the start of the autoregression.

The equations defining

a_{t}

and

b_{t}

are precisely:

$e_{t} = w_{t} - Φ_{1} w_{t - s} - Φ_{2} w_{t - 2 \times s} - \dots - Φ_{P} w_{t - P \times s} + Θ_{1} e_{t - s} + Θ_{2} e_{t - 2 \times s} + \dots + Θ_{Q} e_{t - Q \times s}$ ,
for $t = 1 - q^{'}, 2 - q^{'}, \dots, n$ .
$a_{t} = e_{t} - ϕ_{1} e_{t - 1} - ϕ_{2} e_{t - 2} - \dots - ϕ_{p} e_{t - p} + θ_{1} a_{t - 1} + θ_{2} a_{t - 2} + \dots + θ_{q} a_{t - q}$ ,
for $t = 1 - q^{'}, 2 - q^{'}, \dots, n$ .
$f_{t} = w_{t} - Φ_{1} w_{t + s} - Φ_{2} w_{t + 2 \times s} - \dots - Φ_{P} w_{t + P \times s} + Θ_{1} f_{t - s} + Θ_{2} f_{t - 2 \times s} + \dots + Θ_{Q} f_{t - Q \times s}$ ,
for $t = (1 - q^{'} - s \times P), (2 - q^{'} - s \times P), \dots, (- q^{'} + P)$
$b_{t} = f_{t} - ϕ_{1} f_{t + 1} - ϕ_{2} f_{t + 2} - \dots - ϕ_{p} f_{t + p} + θ_{1} b_{t - 1} + θ_{2} b_{t - 2} + \dots + θ_{q} b_{t - q}$ ,
for $t = (1 - q^{'} - p^{'}), (2 - q^{'} - p^{'}), \dots, (- q^{'})$ .

For all four of these equations, the following conditions hold:

$w_{i} = 0$ if $i < 1 - q^{'}$
$e_{i} = 0$ if $i < 1 - q^{'}$
$a_{i} = 0$ if $i < 1 - q^{'}$
$f_{i} = 0$ if $i < 1 - q^{'} - s \times P$
$b_{i} = 0$ if $i < 1 - q^{'} - p^{'}$

Minimization of

S

with respect to

p m

uses an extension of the algorithm of Marquardt (1963).

The first derivatives of

S

with respect to the parameters are calculated as

2 \times \sum a_{t} \times a_{t, i} - 2 \sum b_{t} \times b_{t, i} = 2 \times G_{i},

where

a_{t, i}

and

b_{t, i}

are derivatives of

a_{t}

and

b_{t}

with respect to the

i

th parameter.

The second derivative of

S

is approximated by

2 \times \sum a_{t, i} \times a_{t, j} - 2 \times \sum b_{t, i} \times b_{t, j} = 2 \times H_{i j} .

Successive parameter iterates are obtained by calculating a vector of corrections

dpm

by solving the equations

(H + α \times D) \times dpm = - G,

where

G

is a vector with elements

G_{i}

H

is a matrix with elements

H_{i j}

α

is a scalar used to control the search and

D

is the diagonal matrix of

H

The new parameter values are then

p m + dpm

The scalar

α

controls the step size, to which it is inversely related.

If a step results in new parameter values which give a reduced value of

S

, then

α

is reduced by a factor

β

. If a step results in new parameter values which give an increased value of

S

, or in ARMA model parameters which in any way contravene the stationarity and invertibility conditions, then the new parameters are rejected,

α

is increased by the factor

β

, and the revised equations are solved for a new parameter correction.

This action is repeated until either a reduced value of

S

is obtained, or

α

reaches the limit of

10^{9}

, which is used to indicate a failure of the search procedure.

This failure may be due to a badly conditioned sum of squares function or to too strict a convergence criterion. Convergence is deemed to have occurred if the fractional reduction in the residual sum of squares in successive iterations is less than a value

γ

, while

α < 1.0

The stationarity and invertibility conditions are tested to within a specified tolerance multiple

δ

of machine accuracy. Upon convergence, or completion of the specified maximum number of iterations without convergence, statistical properties of the estimates are derived. In the latter case the sequence of iterates should be checked to ensure that convergence is adequate for practical purposes, otherwise these properties are not reliable.

The estimated residual variance is

erv = S_{\min} / df,

where

S_{\min}

is the final value of

S

, and the residual number of degrees of freedom is given by

df = N - p - q - P - Q (- 1 ​ if ​ c ​ is estimated) .

The covariance matrix of the vector of estimates

p m

is given by

erv \times H^{- 1},

where

H

is evaluated at the final parameter values.

From this expression are derived the vector of standard deviations, and the correlation matrix for the whole parameter set. These are asymptotic approximations.

The differenced series

w_{t}

(now uncorrected for the constant), intermediate series

e_{t}

and residual series

a_{t}

are all available upon completion of the iterations over the range (extended by backforecasts)

t = 1 - q^{'}, 2 - q^{'}, \dots, N .

The values

a_{t}

can only properly be interpreted as residuals for

t \geq 1 + p^{'} - q^{'}

, as the earlier values are corrupted by transients if

p^{'} > 0

In consequence of the manner in which differencing is implemented, the residual

a_{t}

is the one step ahead forecast error for

x_{t + d^{'}}

For convenient application in forecasting, the following quantities constitute the ‘state set’, which contains the minimum amount of time series information needed to construct forecasts:

(i)	the differenced series $w_{t}$ , for $(N - s \times P) < t \leq N$ ,
(ii)	the $d^{'}$ values required to reconstitute the original series $x_{t}$ from the differenced series $w_{t}$ ,
(iii)	the intermediate series $e_{t}$ , for $(N - \max (p, Q \times s)) < t \leq N$ ,
(iv)	the residual series $a_{t}$ , for $(N - q) < t \leq N$ .

This state set is available upon completion of the iterations. The routine may be used purely for the construction of this state set, given a previously estimated model and time series

x_{t}

, by requesting zero iterations. Backforecasts are estimated, but the model parameter values are unchanged. If later observations become available and it is desired to update the state set, g13agf can be used.

4

References

Box G E P and Jenkins G M (1976) Time Series Analysis: Forecasting and Control (Revised Edition) Holden–Day

Marquardt D W (1963) An algorithm for least squares estimation of nonlinear parameters J. Soc. Indust. Appl. Math. 11 431

5

Arguments

1: $mr (7)$ – Integer arrayInput

On entry: the orders vector

(p, d, q, P, D, Q, s)

of the ARIMA model whose parameters are to be estimated.

p

q

P

and

Q

refer respectively to the number of autoregressive (

ϕ

), moving average

(θ)

, seasonal autoregressive (

Φ

) and seasonal moving average (

Θ

) parameters.

d

D

and

s

refer respectively to the order of non-seasonal differencing, the order of seasonal differencing and the seasonal period.

Constraints:

$p$ , $d$ , $q$ , $P$ , $D$ , $Q$ , $s \geq 0$ ;
$p + q + P + Q > 0$ ;
$s \neq 1$ ;
if $s = 0$ , $P + D + Q = 0$ ;
if $s > 1$ , $P + D + Q > 0$ ;
$d + s \times (P + D) \leq n$ ;
$p + d - q + s \times (P + D - Q) \leq n$ .

2: $par (npar)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: the initial estimates of the

p

values of the

ϕ

parameters, the

q

values of the

θ

parameters, the

P

values of the

Φ

parameters and the

Q

values of the

Θ

parameters, in that order.

On exit: the latest values of the estimates of these parameters.

3: $npar$ – IntegerInput

On entry: the total number of

ϕ

θ

Φ

and

Θ

parameters to be estimated.

Constraint:

npar = p + q + P + Q

4: $c$ – Real (Kind=nag_wp)Input/Output

On entry: if

kfc = 0

, c must contain the expected value,

c

, of the differenced series.

kfc = 1

, c must contain an initial estimate of

c

On exit: if

kfc = 0

, c is unchanged.

kfc = 1

, c contains the latest estimate of

c

Therefore, if c and kfc are both zero on entry, there is no constant correction.

5: $kfc$ – IntegerInput

On entry: must be set to

1

if the constant,

c

, is to be estimated and

0

if it is to be held fixed at its initial value.

Constraint:

kfc = 0

1

6: $x (nx)$ – Real (Kind=nag_wp) arrayInput

On entry: the

n

values of the original undifferenced time series.

7: $nx$ – IntegerInput

On entry:

n

, the length of the original undifferenced time series.

8: $icount (6)$ – Integer arrayOutput

On exit: size of various output arrays.

$icount (1)$: Contains $q + (Q \times s)$ , the number of backforecasts.
$icount (2)$: Contains $n - d - (D \times s)$ , the number of differenced values.
$icount (3)$: Contains $d + (D \times s)$ , the number of values of reconstitution information.
$icount (4)$: Contains $n + q + (Q \times s)$ , the number of values held in each of the series ex, exr and al.
$icount (5)$: Contains $n - d - (D \times s) - p - q - P - Q - kfc$ , the number of degrees of freedom associated with $S$ .
$icount (6)$: Contains $icount (1) + npar + kfc$ , the number of parameters being estimated.

These values are always computed regardless of the exit value of ifail.

9: $ex (iex)$ – Real (Kind=nag_wp) arrayOutput

On exit: the extended differenced series which is made up of:

icount (1)

backforecast values of the differenced series.

icount (2)

actual values of the differenced series.

icount (3)

values of reconstitution information.

The total number of these values held in ex is

icount (4)

If the routine exits because of a faulty input argument, the contents of ex will be indeterminate.

10: $exr (iex)$ – Real (Kind=nag_wp) arrayOutput

On exit: the values of the model residuals which is made up of:

icount (1)

residuals corresponding to the backforecasts in the differenced series.

icount (2)

residuals corresponding to the actual values in the differenced series.

The remaining

icount (3)

values contain zeros.

If the routine exits with ifail holding a value other than

0

9

, the contents of exr will be indeterminate.

11: $al (iex)$ – Real (Kind=nag_wp) arrayOutput

On exit: the intermediate series which is made up of:

icount (1)

intermediate series values corresponding to the backforecasts in the differenced series.

icount (2)

intermediate series values corresponding to the actual values in the differenced series.

The remaining

icount (3)

values contain zeros.

If the routine exits with

ifail \neq 0

, the contents of al will be indeterminate.

12: $iex$ – IntegerInput

On entry: the dimension of the arrays ex, exr and al as declared in the (sub)program from which g13aef is called.

Constraint:

iex \geq q + (Q \times s) + n

, which is equivalent to the exit value of

icount (4)

13: $s$ – Real (Kind=nag_wp)Output

On exit: the residual sum of squares after the latest series of parameter estimates has been incorporated into the model. If the routine exits with a faulty input argument, s contains zero.

14: $g (igh)$ – Real (Kind=nag_wp) arrayOutput

On exit: the latest value of the derivatives of

S

with respect to each of the parameters being estimated (backforecasts, par parameters, and where relevant the constant – in that order). The contents of g will be indeterminate if the routine exits with a faulty input argument.

15: $igh$ – IntegerInput

On entry: the dimension of the arrays g and sd and the second dimension of the arrays h and hc as declared in the (sub)program from which g13aef is called.

Constraint:

igh \geq q + (Q \times s) + npar + kfc

which is equivalent to the exit value of

icount (6)

16: $sd (igh)$ – Real (Kind=nag_wp) arrayOutput

On exit: the standard deviations corresponding to each of the parameters being estimated (backforecasts, par parameters, and where relevant the constant, in that order).

If the routine exits with ifail containing a value other than

0

9

, or if the required number of iterations is zero, the contents of sd will be indeterminate.

17: $h (ldh, igh)$ – Real (Kind=nag_wp) arrayOutput

On exit: the second derivative of

S

and correlation coefficients.

(a)	the latest values of an approximation to the second derivative of $S$ with respect to each of the $(q + Q \times s + npar + kfc)$ parameters being estimated (backforecasts, par parameters, and where relevant the constant – in that order), and
(b)	the correlation coefficients relating to each pair of these parameters.

These are held in a matrix defined by the first

(q + Q \times s + npar + kfc)

rows and the first

(q + Q \times s + npar + kfc)

columns of h. (Note that

icount (6)

contains the value of this expression.) The values of (a) are contained in the upper triangle, and the values of (b) in the strictly lower triangle.

These correlation coefficients are zero during intermediate printout using piv, and indeterminate if ifail contains on exit a value other than

0

9

All the contents of h are indeterminate if the required number of iterations are zero. The

(q + (Q \times s) + npar + kfc + 1)

th row of h is used internally as workspace.

18: $ldh$ – IntegerInput

On entry: the first dimension of the array h and

Constraint:

ldh \geq 1 + q + (Q \times s) + npar + kfc

, which is equivalent to the exit value of

icount (6)

19: $st (ist)$ – Real (Kind=nag_wp) arrayOutput

On exit: the nst values of the state set array. If the routine exits with ifail containing a value other than

0

9

, the contents of st will be indeterminate.

20: $ist$ – IntegerInput

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

Constraint:

ist \geq (P \times s) + d + (D \times s) + q + \max (p, Q \times s)

21: $nst$ – IntegerOutput

On exit: the number of values in the state set array st.

22: $piv$ – Subroutine, supplied by the NAG Library or the user.External Procedure

piv is used to monitor the progress of the optimization.

The specification of piv is:

Fortran Interface

Subroutine piv (

mr, par, npar, c, kfc, icount, s, g, h, ldh, igh, itc, zsp)

Integer, Intent (In)	::	mr(7), npar, kfc, icount(6), ldh, igh, itc
Real (Kind=nag_wp), Intent (In)	::	par(npar), c, s, g(igh), h(ldh,igh), zsp(4)

C Header Interface

#include nagmk26.h

void	piv ( const Integer mr[], const double par[], const Integer npar, const double c, const Integer kfc, const Integer icount[], const double s, const double g[], const double h[], const Integer ldh, const Integer igh, const Integer *itc, const double zsp[])

piv is called on each iteration by g13aef when the input value of kpiv is nonzero and is bypassed when it is

0

The routine g13afz may be used as piv. It prints the heading

G13AFZ MONITORING OUTPUT - ITERATION n

followed by the parameter values and the residual sum of squares. Output is directed to the advisory channel defined by x04abf.

1: $mr (7)$ – Integer arrayInput
2: $par (npar)$ – Real (Kind=nag_wp) arrayInput
3: $npar$ – IntegerInput
4: $c$ – Real (Kind=nag_wp)Input
5: $kfc$ – IntegerInput
6: $icount (6)$ – Integer arrayInput
7: $s$ – Real (Kind=nag_wp)Input
8: $g (igh)$ – Real (Kind=nag_wp) arrayInput
9: $h (ldh, igh)$ – Real (Kind=nag_wp) arrayInput
10: $ldh$ – IntegerInput
11: $igh$ – IntegerInput
12: $itc$ – IntegerInput
13: $zsp (4)$ – Real (Kind=nag_wp) arrayInput: On entry: all the arguments are defined as for g13aef itself.

piv must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which g13aef is called. Arguments denoted as Input must not be changed by this procedure.

kpiv = 0

a dummy piv must be supplied.

23: $kpiv$ – IntegerInput

On entry: must be nonzero if the progress of the optimization is to be monitored using piv. Otherwise kpiv must contain

0

24: $nit$ – IntegerInput

On entry: the maximum number of iterations to be performed.

Constraint:

nit \geq 0

25: $itc$ – IntegerOutput

On exit: the number of iterations performed.

26: $zsp (4)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: when

kzsp = 1

, the first four elements of zsp must contain the four values used to guide the search procedure. These are as follows.

zsp (1)

contains

α

, the value used to constrain the magnitude of the search procedure steps.

zsp (2)

contains

β

, the multiplier which regulates the value

α

zsp (3)

contains

δ

, the value of the stationarity and invertibility test tolerance factor.

zsp (4)

contains

γ

, the value of the convergence criterion.

kzsp \neq 1

on entry, default values for zsp are supplied by the routine.

These are

0.001

10.0

1000.0

and

\max (100 \times machine precision, 0.0000001)

respectively.

On exit: zsp contains the values, default or otherwise, used by the routine.

Constraint: if

kzsp = 1

zsp (1) > 0.0

zsp (2) > 1.0

zsp (3) \geq 1.0

0 \leq zsp (4) < 1.0

27: $kzsp$ – IntegerInput

On entry: the value

1

if the routine is to use the input values of zsp, and any other value if the default values of zsp are to be used.

28: $isf (4)$ – Integer arrayOutput

On exit: contains success/failure indicators, one for each of the four types of parameter in the model (autoregressive, moving average, seasonal autoregressive, seasonal moving average), in that order.

Each indicator has the interpretation:

$- 2$	On entry parameters of this type have initial estimates which do not satisfy the stationarity or invertibility test conditions.
$- 1$	The search procedure has failed to converge because the latest set of parameter estimates of this type is invalid.
$0$	No parameter of this type is in the model.
$1$	Valid final estimates for parameters of this type have been obtained.

29: $wa (iwa)$ – Real (Kind=nag_wp) arrayWorkspace

30: $iwa$ – IntegerInput

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

Constraint:

iwa \geq (F_{1} \times F_{2}) + (9 \times npar),

where	$F_{1} = nx + 1 + p + (P \times s) + q + (Q \times s)$ ;
and	$F_{2} = 8$ if $kfc = 1$ ;
	$F_{2} = 7$ if $kfc = 0$ , $Q > 0$ ;
	$F_{2} = 6$ if $kfc = 0$ , $Q = 0$ , $P > 0$ ;
	$F_{2} = 5$ if $kfc = 0$ , $Q = 0$ , $P = 0$ , $q > 0$ ;
	$F_{2} = 4$ otherwise.

31: $hc (ldh, igh)$ – Real (Kind=nag_wp) arrayWorkspace

32: $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: g13aef 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,	$npar \neq p + q + P + Q$ ,
or	the orders vector mr is invalid (check it against the constraints in Section 5),
or	$kfc \neq 0$ or $1$ .

$ifail = 2$: On entry, $nx - d - D \times s \leq npar + kfc$ , i.e., the number of terms in the differenced series is not greater than the number of parameters in the model. The model is over-parameterised.

$ifail = 3$

On entry,	one or more of the user-supplied criteria for controlling the iterative process are invalid,
or	$nit < 0$ ,
or	if $kzsp = 1$ , $zsp (1) \leq 0.0$ ;
or	if $kzsp = 1$ , $zsp (2) \leq 1.0$ ;
or	if $kzsp = 1$ , $zsp (3) < 1.0$ ;
or	if $kzsp = 1$ , $zsp (4) < 0.0$ ;
or	if $kzsp = 1$ , $zsp (4) \geq 1.0$ .

$ifail = 4$: On entry, the state set array st is too small. The output value of nst contains the required value (see the description of ist in Section 5 for the formula).

$ifail = 5$: On entry, the workspace array wa is too small. Check the value of iwa against the constraints in Section 5.

$ifail = 6$

On entry,	$iex < q + (Q \times s) + nx$ ,
or	$igh < q + (Q \times s) + npar + kfc$ ,
or	$ldh \leq q + (Q \times s) + npar + kfc$ .

$ifail = 7$: This indicates a failure in the search procedure, with $zsp (1) \geq 1.0E09$ .

Some output arguments may contain meaningful values; see Section 5 for details.

$ifail = 8$: This indicates a failure to invert $H$ .

Some output arguments may contain meaningful values; see Section 5 for details.

$ifail = 9$: Unable to calculate the latest estimates of the backforecasts.

Some output arguments may contain meaningful values; see Section 5 for details.

$ifail = 10$: Satisfactory parameter estimates could not be obtained for all parameter types in the model. Inspect array isf for further information on the parameter type(s) in error.

$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

The computations are believed to be stable.

8

Parallelism and Performance

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

g13aef 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

The time taken by g13aef is approximately proportional to

nx \times itc \times {(q + Q \times s + npar + kfc)}^{2}

10

Example

The following program reads

30

observations from a time series relating to the rate of the earth's rotation about its polar axis. Differencing of order

1

is applied, and the number of non-seasonal parameters is

3

, one autoregressive

(ϕ)

, and two moving average

(θ)

. No seasonal effects are taken into account.

The constant is estimated. Up to

25

iterations are allowed.

The initial estimates of

ϕ_{1}

θ_{1}

θ_{2}

and

c

are zero.

NAG Library Routine Document

g13aef (uni_arima_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