NAG Library Routine Document

Integer, Intent (In)	::	n
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	t(0:n)
Real (Kind=nag_wp), Intent (Inout)	::	p(), v()
Real (Kind=nag_wp), Intent (Out)	::	x(n), vlast, work(n-1)
Logical, Intent (In)	::	wantp, wantv

C Header Interface

#include <nagmk26.h>

void	f04fef_ (const Integer n, const double t[], double x[], const logical wantp, double p[], const logical wantv, double v[], double vlast, double work[], Integer *ifail)

3

Description

f04fef solves the equations

T x = - t,

where

T

is the

n

n

symmetric positive definite Toeplitz matrix

T = (\begin{array}{l} τ_{0} & τ_{1} & τ_{2} & \dots & τ_{n - 1} \\ τ_{1} & τ_{0} & τ_{1} & \dots & τ_{n - 2} \\ τ_{2} & τ_{1} & τ_{0} & \dots & τ_{n - 3} \\ . & . & . & . \\ τ_{n - 1} & τ_{n - 2} & τ_{n - 3} & \dots & τ_{0} \end{array})

and

t

is the vector

t^{T} = (τ_{1}, τ_{2} \dots τ_{n}) .

The routine uses the method of Durbin (see Durbin (1960) and Golub and Van Loan (1996)). Optionally the mean square prediction errors and/or the partial correlation coefficients for each step can be returned.

4

References

Bunch J R (1985) Stability of methods for solving Toeplitz systems of equations SIAM J. Sci. Statist. Comput. 6 349–364

Bunch J R (1987) The weak and strong stability of algorithms in numerical linear algebra Linear Algebra Appl. 88/89 49–66

Cybenko G (1980) The numerical stability of the Levinson–Durbin algorithm for Toeplitz systems of equations SIAM J. Sci. Statist. Comput. 1 303–319

Durbin J (1960) The fitting of time series models Rev. Inst. Internat. Stat. 28 233

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5

Arguments

1: $n$ – IntegerInput: On entry: the order of the Toeplitz matrix $T$ .

Constraint: $n \geq 0$ . When $n = 0$ , an immediate return is effected.
2: $t (0 : n)$ – Real (Kind=nag_wp) arrayInput: On entry: $t (0)$ must contain the value $τ_{0}$ of the diagonal elements of $T$ , and the remaining n elements of t must contain the elements of the vector $t$ .

Constraint: $t (0) > 0.0$ . Note that if this is not true, the Toeplitz matrix cannot be positive definite.
3: $x (n)$ – Real (Kind=nag_wp) arrayOutput: On exit: the solution vector $x$ .
4: $wantp$ – LogicalInput: On entry: must be set to .TRUE. if the partial (auto)correlation coefficients are required, and must be set to .FALSE. otherwise.
5: $p (*)$ – Real (Kind=nag_wp) arrayOutput: Note: the dimension of the array p must be at least $\max (1, n)$ if $wantp = .TRUE.$ , and at least $1$ otherwise.

On exit: with wantp as .TRUE., the $i$ th element of p contains the partial (auto)correlation coefficient, or reflection coefficient, $p_{i}$ for the $i$ th step. (See Section 9 and Chapter G13.) If wantp is .FALSE., p is not referenced. Note that in any case, $x_{n} = p_{n}$ .
6: $wantv$ – LogicalInput: On entry: must be set to .TRUE. if the mean square prediction errors are required, and must be set to .FALSE. otherwise.
7: $v (*)$ – Real (Kind=nag_wp) arrayOutput: Note: the dimension of the array v must be at least $\max (1, n)$ if $wantv = .TRUE.$ , and at least $1$ otherwise.

On exit: with wantv as .TRUE., the $i$ th element of v contains the mean square prediction error, or predictor error variance ratio, $v_{i}$ , for the $i$ th step. (See Section 9 and Chapter G13.) If wantv is .FALSE., v is not referenced.
8: $vlast$ – Real (Kind=nag_wp)Output: On exit: the value of $v_{n}$ , the mean square prediction error for the final step.
9: $work (n - 1)$ – Real (Kind=nag_wp) arrayWorkspace
10: $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: f04fef may return useful information for one or more of the following detected errors or warnings.

Errors or warnings detected by the routine:

$ifail > 0$

Principal minor

〈value〉

is not positive definite. Value of the reflection coefficient is

〈value〉

If, on exit,

x_{ifail}

is close to unity, the principal minor was close to being singular, and the sequence

τ_{0}, τ_{1}, \dots, τ_{ifail}

may be a valid sequence nevertheless. The first ifail elements of x return the solution of the equations

T_{ifail} x = - {(τ_{1}, τ_{2}, \dots, τ_{ifail})}^{T},

where

T_{ifail}

is the ifailth principal minor of

T

. Similarly, if wantp and/or wantv are true, then p and/or v return the first ifail elements of p and v respectively and vlast returns

v_{ifail}

. In particular if

ifail = n

, then the solution of the equations

T x = - t

is returned in x, but

τ_{n}

is such that

T_{n + 1}

would not be positive definite to working accuracy.

$ifail = - 1$: On entry, $n = 〈value〉$ .
Constraint: $n \geq 0$ .

On entry, $t (0) = 〈value〉$ .
Constraint: $t (0) > 0.0$ .

$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 computed solution of the equations certainly satisfies

r = T x + t,

where

{‖r‖}_{1}

is approximately bounded by

{‖r‖}_{1} \leq c ε (\prod_{i = 1}^{n} (1 + |p_{i}|) - 1),

c

being a modest function of

n

and

ε

being the machine precision. This bound is almost certainly pessimistic, but it has not yet been established whether or not the method of Durbin is backward stable. If

|p_{n}|

is close to one, then the Toeplitz matrix is probably ill-conditioned and hence only just positive definite. For further information on stability issues see Bunch (1985), Bunch (1987), Cybenko (1980) and Golub and Van Loan (1996). The following bounds on

{‖t^{- 1}‖}_{1}

hold:

\max (\frac{1}{v_{n - 1}}, \frac{1}{\prod_{i = 1}^{n - 1} (1 - p_{i})}) \leq {‖T^{- 1}‖}_{1} \leq \prod_{i = 1}^{n - 1} (\frac{1 + |p_{i}|}{1 - |p_{i}|}) .

Note:

v_{n} < v_{n - 1}

. The norm of

T^{- 1}

may also be estimated using routine f04ydf.

8

Parallelism and Performance

f04fef 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 number of floating-point operations used by f04fef is approximately

2 n^{2}

, independent of the values of wantp and wantv.

The mean square prediction error,

v_{i}

, is defined as

v_{i} = (τ_{0} + (τ_{1} τ_{2} \dots τ_{i - 1}) y_{i - 1}) / τ_{0},

where

y_{i}

is the solution of the equations

T_{i} y_{i} = - {(τ_{1} τ_{2} \dots τ_{i})}^{T}

and the partial correlation coefficient,

p_{i}

, is defined as the

i

th element of

y_{i}

. Note that

v_{i} = (1 - p_{i}^{2}) v_{i - 1}

10

Example

This example finds the solution of the Yule–Walker equations

T x = - t

, where

T = (\begin{array}{l} 4 & 3 & 2 & 1 \\ 3 & 4 & 3 & 2 \\ 2 & 3 & 4 & 3 \\ 1 & 2 & 3 & 4 \end{array}) and t = (\begin{array}{l} 3 \\ 2 \\ 1 \\ 0 \end{array}) .

NAG Library Routine Document

f04fef (real_toeplitz_yule)

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