g02jef fits a multi-level linear mixed effects regression model using maximum likelihood (ML). Prior to calling g02jef the initialization routine g02jcf must be called.

2 Specification

Fortran Interface

Subroutine g02jef (

lvpr, vpr, nvpr, gamma, effn, rnkx, ncov, lnlike, lb, id, ldid, b, se, czz, ldczz, cxx, ldcxx, cxz, ldcxz, rcomm, icomm, iopt, liopt, ropt, lropt, ifail)

Integer, Intent (In)	::	lvpr, vpr(lvpr), nvpr, lb, ldid, ldczz, ldcxx, ldcxz, iopt(liopt), liopt, lropt
Integer, Intent (Inout)	::	icomm(*), ifail
Integer, Intent (Out)	::	effn, rnkx, ncov, id(ldid,*)
Real (Kind=nag_wp), Intent (In)	::	ropt(lropt)
Real (Kind=nag_wp), Intent (Inout)	::	gamma(nvpr+1), czz(ldczz,), cxx(ldcxx,), cxz(ldcxz,), rcomm()
Real (Kind=nag_wp), Intent (Out)	::	lnlike, b(lb), se(lb)

C Header Interface

#include <nag.h>

void

g02jef_ (const Integer *lvpr, const Integer vpr[], const Integer *nvpr, double gamma[], Integer *effn, Integer *rnkx, Integer *ncov, double *lnlike, const Integer *lb, Integer id[], const Integer *ldid, double b[], double se[], double czz[], const Integer *ldczz, double cxx[], const Integer *ldcxx, double cxz[], const Integer *ldcxz, double rcomm[], Integer icomm[], const Integer iopt[], const Integer *liopt, const double ropt[], const Integer *lropt, Integer *ifail)

The routine may be called by the names g02jef or nagf_correg_mixeff_hier_ml.

3 Description

g02jef fits a model of the form:

y = X β + Z ν + ε

where	$y$ is a vector of $n$ observations on the dependent variable,
	$X$ is a known $n$ by $p$ design matrix for the fixed independent variables,
	$β$ is a vector of length $p$ of unknown fixed effects,
	$Z$ is a known $n$ by $q$ design matrix for the random independent variables,
	$ν$ is a vector of length $q$ of unknown random effects,
and	$ε$ is a vector of length $n$ of unknown random errors.

Both

ν

and

ε

are assumed to have a Gaussian distribution with expectation zero and variance/covariance matrix defined by

Var [\begin{matrix} ν \\ ε \end{matrix}] = [\begin{matrix} G & 0 \\ 0 & R \end{matrix}]

where

R = σ_{R}^{2} I

I

is the

n \times n

identity matrix and

G

is a diagonal matrix. It is assumed that the random variables,

Z

, can be subdivided into

g \leq q

groups with each group being identically distributed with expectation zero and variance

σ_{i}^{2}

. The diagonal elements of matrix

G

therefore take one of the values

\{σ_{i}^{2} : i = 1, 2, \dots, g\}

, depending on which group the associated random variable belongs to.

The model therefore contains three sets of unknowns: the fixed effects

β

, the random effects

ν

and a vector of

g + 1

variance components

γ

, where

γ = \{σ_{1}^{2}, σ_{2}^{2}, \dots, σ_{g - 1}^{2}, σ_{g}^{2}, σ_{R}^{2}\}

. Rather than working directly with

γ

, g02jef uses an iterative process to estimate

γ^{*} = \{σ_{1}^{2} / σ_{R}^{2}, σ_{2}^{2} / σ_{R}^{2}, \dots, σ_{g - 1}^{2} / σ_{R}^{2}, σ_{g}^{2} / σ_{R}^{2}, 1\}

. Due to the iterative nature of the estimation a set of initial values,

γ_{0}

, for

γ^{*}

is required. g02jef allows these initial values either to be supplied by you or calculated from the data using the minimum variance quadratic unbiased estimators (MIVQUE0) suggested by Rao (1972).

g02jef fits the model by maximizing the log-likelihood function:

- 2 l_{R} = \log (|V|) + n \log (r^{T} V^{- 1} r) + \log (2 π / n)

where

V = Z G Z^{T} + R, r = y - X b and b = {(X^{T} V^{- 1} X)}^{- 1} X^{T} V^{- 1} y .

Once the final estimates for

γ^{*}

have been obtained, the value of

σ_{R}^{2}

is given by

σ_{R}^{2} = (r^{T} V^{- 1} r) / (n - p) .

Case weights,

W_{c}

, can be incorporated into the model by replacing

X^{T} X

and

Z^{T} Z

with

X^{T} W_{c} X

and

Z^{T} W_{c} Z

respectively, for a diagonal weight matrix

W_{c}

The log-likelihood,

l_{R}

, is calculated using the sweep algorithm detailed in Wolfinger et al. (1994).

4 References

Goodnight J H (1979) A tutorial on the SWEEP operator The American Statistician 33(3) 149–158

Harville D A (1977) Maximum likelihood approaches to variance component estimation and to related problems JASA 72 320–340

Rao C R (1972) Estimation of variance and covariance components in a linear model J. Am. Stat. Assoc. 67 112–115

Stroup W W (1989) Predictable functions and prediction space in the mixed model procedure Applications of Mixed Models in Agriculture and Related Disciplines Southern Cooperative Series Bulletin No. 343 39–48

Wolfinger R, Tobias R and Sall J (1994) Computing Gaussian likelihoods and their derivatives for general linear mixed models SIAM Sci. Statist. Comput. 15 1294–1310

5 Arguments

Note: prior to calling g02jef the initialization routine g02jcf must be called, therefore this documention should be read in conjunction with the document for g02jcf. In particular some argument names and conventions described in that document are also relevant here, but their definition has not been repeated. Specifically, rndm, weight, n, nff, nrf, nlsv, levels, fixed, dat, licomm and lrcomm should be interpreted identically in both routines.

1: $lvpr$ – Integer Input

On entry: the sum of the number of random parameters and the random intercept flags specified in the call to g02jcf.

Constraint:

lvpr = \sum_{i} rndm (1, i) + rndm (2, i)

2: $vpr (lvpr)$ – Integer array Input

On entry: a vector of flags indicating the mapping between the random variables specified in rndm and the variance components,

σ_{i}^{2}

. See Section 9 for more details.

Constraint:

1 \leq vpr (i) \leq nvpr

, for

i = 1, 2, \dots, lvpr

3: $nvpr$ – Integer Input

On entry:

g

, the number of variance components being estimated (excluding the overall variance,

σ_{R}^{2}

Constraint:

1 \leq nvpr \leq lvpr

4: $gamma (nvpr + 1)$ – Real (Kind=nag_wp) array Input/Output

On entry: holds the initial values of the variance components,

γ_{0}

, with

gamma (i)

the initial value for

σ_{i}^{2} / σ_{R}^{2}

, for

i = 1, 2, \dots, nvpr

gamma (1) = - 1.0

, the remaining elements of gamma are ignored and the initial values for the variance components are estimated from the data using MIVQUE0.

On exit:

gamma (i)

, for

i = 1, 2, \dots, nvpr

, holds the final estimate of

σ_{i}^{2}

and

gamma (nvpr + 1)

holds the final estimate for

σ_{R}^{2}

Constraint:

gamma (1) = - 1.0

gamma (i) \geq 0.0

, for

i = 1, 2, \dots, g

5: $effn$ – Integer Output

On exit: effective number of observations. If no weights were supplied to g02jcf or all supplied weights were nonzero,

effn = n

6: $rnkx$ – Integer Output

On exit: the rank of the design matrix,

X

, for the fixed effects.

7: $ncov$ – Integer Output

On exit: number of variance components not estimated to be zero. If none of the variance components are estimated to be zero, then

ncov = nvpr

8: $lnlike$ – Real (Kind=nag_wp) Output

On exit:

- 2 l_{R} (\hat{γ})

where

l_{R}

is the log of the maximum likelihood calculated at

\hat{γ}

, the estimated variance components returned in gamma.

9: $lb$ – Integer Input

On entry: the dimension of the arrays b and se as declared in the (sub)program from which g02jef is called.

Constraint:

lb \geq nff + nrf \times nlsv

10: $id (ldid *)$ – Integer array Output

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

lb

(see g02jcf).

On exit: an array describing the parameter estimates returned in b. The first

nlsv \times nrf

columns of id describe the parameter estimates for the random effects and the last nff columns the parameter estimates for the fixed effects.

The example program for this routine includes a demonstration of decoding the parameter estimates given in b using information from id.

For fixed effects:

for l=nrf×nlsv+1 ,…, nrf×nlsv+nff
- if $b (l)$ contains the parameter estimate for the intercept, then
  $id (1, l) = id (2, l) = id (3, l) = 0;$
- if $b (l)$ contains the parameter estimate for the $i$ th level of the $j$ th fixed variable, that is the vector of values held in the $k$ th column of dat when $fixed (j + 2) = k$ then
  $\begin{array}{l} id (1, l) = 0, \\ id (2, l) = j, \\ id (3, l) = i; \end{array}$
- if the $j$ th variable is continuous or binary, that is $levels (fixed (j + 2)) = 1$ , $id (3, l) = 0$ ;
- any remaining rows of the $l$ th column of id are set to $0$ .

For random effects:

let
- $N_{R_{b}}$ denote the number of random variables in the $b$ th random statement, that is $N_{R_{b}} = rndm (1, b)$ ;
- $R_{j b}$ denote the $j$ th random variable from the $b$ th random statement, that is the vector of values held in the $k$ th column of dat when $rndm (2 + j, b) = k$ ;
- $N_{S_{b}}$ denote the number of subject variables in the $b$ th random statement, that is $N_{S_{b}} = rndm (3 + N_{R_{b}}, b)$ ;
- $S_{j b}$ denote the $j$ th subject variable from the $b$ th random statement, that is the vector of values held in the $k$ th column of dat when $rndm (3 + N_{R_{b}} + j, b) = k$ ;
- $L (S_{j b})$ denote the number of levels for $S_{j b}$ , that is $L (S_{j b}) = levels (rndm (3 + N_{R_{b}} + j, b))$ ;
then
- for $l = 1, 2, \dots nrf \times nlsv$ , if $b (l)$ contains the parameter estimate for the $i$ th level of $R_{j b}$ when $S_{k b} = s_{k}$ , for $k = 1, 2, \dots, N_{S_{b}}$ and $1 \leq s_{k} \leq L (S_{j b})$ , i.e., $s_{k}$ is a valid value for the $k$ th subject variable, then
  $\begin{array}{l} id (1, l) = b, \\ id (2, l) = j, \\ id (3, l) = i, \\ id (3 + k, l) = s_{k}, k = 1, 2, \dots, N_{S_{b}}; \end{array}$
- if the parameter being estimated is for the intercept, then $id (2, l) = id (3, l) = 0$ ;
- if the $j$ th variable is continuous, or binary, that is $L (S_{j b}) = 1$ , then $id (3, l) = 0$ ;
- the remaining rows of the $l$ th column of id are set to $0$ .

In some situations, certain combinations of variables are never observed. In such circumstances all elements of the

l

th row of id are set to

- 999

11: $ldid$ – Integer Input

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

Constraint:

ldid \geq 3 + \max_{j} (rndm (3 + rndm (1, j), j))

, i.e.,

3 +

maximum number of subject variables (see g02jcf).

12: $b (lb)$ – Real (Kind=nag_wp) array Output

On exit: the parameter estimates, with the first

nrf \times nlsv

elements of

b

containing the parameter estimates for the random effects,

ν

, and the remaining nff elements containing the parameter estimates for the fixed effects,

β

. The order of these estimates are described by the id argument.

13: $se (lb)$ – Real (Kind=nag_wp) array Output

On exit: the standard errors of the parameter estimates given in b.

14: $czz (ldczz *)$ – Real (Kind=nag_wp) array Output

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

nlsv \times nrf

(see g02jcf).

On exit: if

nlsv = 1

, then czz holds the lower triangular portion of the matrix

(1 / σ^{2}) (Z^{T} {\hat{R}}^{- 1} Z + {\hat{G}}^{- 1})

, where

\hat{R}

and

\hat{G}

are the estimates of

R

and

G

respectively. If

nlsv > 1

, then czz holds this matrix in compressed form, with the first nrf columns holding the part of the matrix corresponding to the first level of the overall subject variable, the next nrf columns the part corresponding to the second level of the overall subject variable etc.

15: $ldczz$ – Integer Input

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

Constraint:

ldczz \geq nrf

16: $cxx (ldcxx *)$ – Real (Kind=nag_wp) array Output

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

nff

On exit: cxx holds the lower triangular portion of the matrix

(1 / σ^{2}) X^{T} {\hat{V}}^{- 1} X

, where

\hat{V}

is the estimated value of

V

17: $ldcxx$ – Integer Input

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

Constraint:

ldcxx \geq nff

18: $cxz (ldcxz *)$ – Real (Kind=nag_wp) array Output

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

nlsv \times nrf

(see g02jcf).

On exit: if

nlsv = 1

, then cxz holds the matrix

(1 / σ^{2}) (X^{T} {\hat{V}}^{- 1} Z) \hat{G}

, where

\hat{V}

and

\hat{G}

are the estimates of

V

and

G

respectively. If

nlsv > 1

, then cxz holds this matrix in compressed form, with the first nrf columns holding the part of the matrix corresponding to the first level of the overall subject variable, the next nrf columns the part corresponding to the second level of the overall subject variable etc.

19: $ldcxz$ – Integer Input

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

Constraint:

ldcxz \geq nff

20: $rcomm (*)$ – Real (Kind=nag_wp) array Communication Array

On entry: communication array initialized by a call to g02jcf.

21: $icomm (*)$ – Integer array Communication Array

On entry: communication array initialized by a call to g02jcf.

22: $iopt (liopt)$ – Integer array Input

On entry: optional parameters passed to the optimization routine.

By default g02jef fits the specified model using a modified Newton optimization algorithm as implemented in e04lbf. In some cases, where the calculation of the derivatives is computationally expensive it may be more efficient to use a sequential QP algorithm. The sequential QP algorithm as implemented in e04uca can be chosen by setting

iopt (5) = 1

. If

liopt < 5

iopt (5) \neq 1

, then the modified Newton algorithm will be used.

Different optional parameters are available depending on the optimization routine used. In all cases, using a value of

- 1

will cause the default value to be used. In addition only the first liopt values of iopt are used, so for example, if only the first element of iopt needs changing and default values for all other optional parameters are sufficient liopt can be set to

1

The following table lists the association between elements of iopt and arguments in the optimizer when the modified Newton algorithm is being used.

$i$	Description	Equivalent argument	Default Value
$1$	Number of iterations	maxcal	$1000$
$2$	Unit number for monitoring information	n/a	As returned by x04abf
$3$	Print optional parameters ( $1 =$ print)	n/a	$- 1$ (no printing performed)
$4$	Frequency that monitoring information is printed	iprint	$- 1$
$5$	Optimizer used	n/a	n/a

If requested, monitoring information is displayed in a similar format to that given by the modified Newton optimizer.

The following table lists the association between elements of iopt and optional parameters in the optimizer when the sequential QP algorithm is being used.

$i$	Description	Equivalent optional parameter	Default Value
$1$	Number of iterations	Major Iteration Limit	$\max (50, 3 \times nvpr)$
$2$	Unit number for monitoring information	n/a	As returned by x04abf
$3$	Print optional parameters ( $1 =$ print, otherwise no print)	List/Nolist	$- 1$ (no printing performed)
$4$	Frequency that monitoring information is printed	Major Print Level	$0$
$5$	Optimizer used	n/a	n/a
$6$	Number of minor iterations	Minor Iteration Limit	$\max (50, 3 \times nvpr)$
$7$	Frequency that additional monitoring information is printed	Minor Print Level	$0$

liopt \leq 0

, default values are used for all optional parameters and iopt is not referenced.

23: $liopt$ – Integer Input

On entry: length of the options array iopt.

24: $ropt (lropt)$ – Real (Kind=nag_wp) array Input

On entry: optional parameters passed to the optimization routine.

Different optional parameters are available depending on the optimization routine used. In all cases, using a value of

- 1.0

will cause the default value to be used. In addition only the first lropt values of ropt are used, so for example, if only the first element of ropt needs changing and default values for all other optional parameters are sufficient lropt can be set to

1

The following table lists the association between elements of ropt and arguments in the optimizer when the modified Newton algorithm is being used.

$i$	Description	Equivalent argument	Default Value
$1$	Sweep tolerance	n/a	$\max (\sqrt{eps}, \sqrt{eps} \times \max_{i} ({zz}_{i i}))$
$2$	Lower bound for $γ^{*}$	n/a	$eps / 100$
$3$	Upper bound for $γ^{*}$	n/a	$10^{20}$
$4$	Accuracy of linear minimizations	eta	$0.9$
$5$	Accuracy to which solution is required	xtol	$0.0$
$6$	Initial distance from solution	stepmx	$100000.0$

The following table lists the association between elements of ropt and optional parameters in the optimizer when the sequential QP algorithm is being used.

$i$	Description	Equivalent optional parameter	Default Value
$1$	Sweep tolerance	n/a	$\max (\sqrt{eps}, \sqrt{eps} \times \max_{i} ({zz}_{i i}))$
$2$	Lower bound for $γ^{*}$	n/a	$eps / 100$
$3$	Upper bound for $γ^{*}$	n/a	$10^{20}$
$4$	Line search tolerance	Line Search Tolerance	$0.9$
$5$	Optimality tolerance	Optimality Tolerance	${eps}^{0.72}$

where

eps

is the machine precision returned by x02ajf and

{zz}_{i i}

denotes the

i

diagonal element of

Z^{T} Z

lropt \leq 0

, then default values are used for all optional parameters and ropt is not referenced.

25: $lropt$ – Integer Input

On entry: length of the options array ropt.

26: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

- 1

1

to set behaviour on detection of an error; these values have no effect when no error is detected.

A value of

0

causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of

- 1

means that an error message is printed while a value of

1

means that it is not.

If halting is not appropriate, the value

- 1

1

is recommended. If message printing is undesirable, then the value

1

is recommended. Otherwise, the value

0

is recommended. 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 = 1$: On entry, $lvpr = 〈value〉$ .
Constraint: $lvpr \geq 〈value〉$ .

$ifail = 2$: On entry, $vpr (〈value〉) = 〈value〉$ and $nvpr = 〈value〉$ .
Constraint: $1 \leq vpr (i) \leq nvpr$ .

$ifail = 3$: On entry, $nvpr = 〈value〉$ .
Constraint: $1 \leq nvpr \leq 〈value〉$ .

$ifail = 4$: On entry, $gamma (〈value〉) = 〈value〉$ .
Constraint: $gamma (1) = - 1.0$ or $gamma (i) \geq 0.0$ .

$ifail = 9$: On entry, $lb = 〈value〉$ .
Constraint: $lb \geq 〈value〉$ .

$ifail = 11$: On entry, $ldid = 〈value〉$ .
Constraint: $ldid \geq 〈value〉$ .

$ifail = 15$: On entry, $ldczz = 〈value〉$ .
Constraint: $ldczz \geq 〈value〉$ .

$ifail = 17$: On entry, $ldcxx = 〈value〉$ .
Constraint: $ldcxx \geq 〈value〉$ .

$ifail = 19$: On entry, $ldcxz = 〈value〉$ .
Constraint: $ldcxz \geq 〈value〉$ .

$ifail = 21$: On entry, icomm has not been initialized correctly.

$ifail = 32$: On entry, at least one value of i, for $i = 1, 2, \dots, nvpr$ , does not appear in vpr.

$ifail = 101$: Optimal solution found, but requested accuracy not achieved.

$ifail = 102$: Too many major iterations.

$ifail = 103$: Current point cannot be improved upon.

$ifail = 104$: At least one negative estimate for gamma was obtained. All negative estimates have been set to zero.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

Not applicable.

8 Parallelism and Performance

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

g02jef 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 argument vpr gives the mapping between the random variables and the variance components. In most cases

vpr (i) = i

, for

i = 1, 2, \dots, \sum_{i} rndm (1, i) + rndm (2, i)

. However, in some cases it might be necessary to associate more than one random variable with a single variance component, for example, when the columns of dat hold dummy variables.

Consider a dataset with three variables:

dat = (\begin{matrix} 1 & 1 & 3.6 \\ 2 & 1 & 4.5 \\ 3 & 1 & 1.1 \\ 1 & 2 & 8.3 \\ 2 & 2 & 7.2 \\ 3 & 2 & 6.1 \end{matrix})

where the first column corresponds to a categorical variable with three levels, the next to a categorical variable with two levels and the last column to a continuous variable. So in a call to g02jcf

levels = (\begin{matrix} 3 & 2 & 1 \end{matrix})

also assume a model with no fixed effects, no random intercept, no nesting and all three variables being included as random effects, then

\begin{matrix} fixed = (\begin{matrix} 0 & 0 \end{matrix}); \\ rndm = {(\begin{matrix} 3 & 0 & 1 & 2 & 3 \end{matrix})}^{T} . \end{matrix}

Each of the three columns in dat therefore correspond to a single variable and hence there are three variance components, one for each random variable included in the model, so

vpr = (\begin{matrix} 1 & 2 & 3 \end{matrix}) .

This is the recommended way of supplying the data to g02jef, however it is possible to reformat the above dataset by replacing each of the categorical variables with a series of dummy variables, one for each level. The dataset then becomes

dat = (\begin{matrix} 1 & 0 & 0 & 1 & 0 & 3.6 \\ 0 & 1 & 0 & 1 & 0 & 4.5 \\ 0 & 0 & 1 & 1 & 0 & 1.1 \\ 1 & 0 & 0 & 0 & 1 & 8.3 \\ 0 & 1 & 0 & 0 & 1 & 7.2 \\ 0 & 0 & 1 & 0 & 1 & 6.1 \end{matrix})

where each column only has one level

levels = (\begin{matrix} 1 & 1 & 1 & 1 & 1 & 1 \end{matrix}) .

Again a model with no fixed effects, no random intercept, no nesting and all variables being included as random effects is required, so

\begin{matrix} fixed = (\begin{matrix} 0 & 0 \end{matrix}); \\ rndm = {(\begin{matrix} 6 & 0 & 1 & 2 & 3 & 4 & 5 & 6 \end{matrix})}^{T} . \end{matrix}

With the data entered in this manner, the first three columns of dat correspond to a single variable (the first column of the original dataset) as do the next two columns (the second column of the original dataset). Therefore vpr must reflect this

vpr = (\begin{matrix} 1 & 1 & 1 & 2 & 2 & 3 \end{matrix}) .

In most situations it is more efficient to supply the data to g02jcf in terms of categorical variables rather than transform them into dummy variables.

9.1 Internal Changes

Internal changes have been made to this routine as follows:

At Mark 27: The algorithm underlying this routine has been altered to improve efficiency. The design matrices are now reordered internally before performing the analysis. It is therefore no longer necessary to construct rndm in the previously recommended manner.

For details of all known issues which have been reported for the NAG Library please refer to the Known Issues.

10 Example

This example fits a random effects model with three levels of nesting to a simulated dataset with

90

observations and

12

variables.

g02je: FL CL CPP AD

NAG FL Interfaceg02jef (mixeff_​hier_​ml)

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

9.1 Internal Changes

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
g02jef (mixeff_hier_ml)