NAG FL Interface
g02gaf (glm_normal)
1
Purpose
g02gaf fits a generalized linear model with normal errors.
2
Specification
Fortran Interface
Subroutine g02gaf ( 
link, mean, offset, weight, n, x, ldx, m, isx, ip, y, wt, s, a, rss, idf, b, irank, se, cov, v, ldv, tol, maxit, iprint, eps, wk, ifail) 
Integer, Intent (In) 
:: 
n, ldx, m, isx(m), ip, ldv, maxit, iprint 
Integer, Intent (Inout) 
:: 
ifail 
Integer, Intent (Out) 
:: 
idf, irank 
Real (Kind=nag_wp), Intent (In) 
:: 
x(ldx,m), y(n), wt(*), a, tol, eps 
Real (Kind=nag_wp), Intent (Inout) 
:: 
s, v(ldv,ip+7) 
Real (Kind=nag_wp), Intent (Out) 
:: 
rss, b(ip), se(ip), cov(ip*(ip+1)/2), wk((ip*ip+3*ip+22)/2) 
Character (1), Intent (In) 
:: 
link, mean, offset, weight 

C Header Interface
#include <nag.h>
void 
g02gaf_ (const char *link, const char *mean, const char *offset, const char *weight, const Integer *n, const double x[], const Integer *ldx, const Integer *m, const Integer isx[], const Integer *ip, const double y[], const double wt[], double *s, const double *a, double *rss, Integer *idf, double b[], Integer *irank, double se[], double cov[], double v[], const Integer *ldv, const double *tol, const Integer *maxit, const Integer *iprint, const double *eps, double wk[], Integer *ifail, const Charlen length_link, const Charlen length_mean, const Charlen length_offset, const Charlen length_weight) 

C++ Header Interface
#include <nag.h> extern "C" {
void 
g02gaf_ (const char *link, const char *mean, const char *offset, const char *weight, const Integer &n, const double x[], const Integer &ldx, const Integer &m, const Integer isx[], const Integer &ip, const double y[], const double wt[], double &s, const double &a, double &rss, Integer &idf, double b[], Integer &irank, double se[], double cov[], double v[], const Integer &ldv, const double &tol, const Integer &maxit, const Integer &iprint, const double &eps, double wk[], Integer &ifail, const Charlen length_link, const Charlen length_mean, const Charlen length_offset, const Charlen length_weight) 
}

The routine may be called by the names g02gaf or nagf_correg_glm_normal.
3
Description
A generalized linear model with Normal errors consists of the following elements:

(a)a set of $n$ observations, ${y}_{i}$, from a Normal distribution with probability density function:
where $\mu $ is the mean and ${\sigma}^{2}$ is the variance.

(b)$X$, a set of $p$ independent variables for each observation, ${x}_{1},{x}_{2},\dots ,{x}_{p}$.

(c)a linear model:

(d)a link between the linear predictor, $\eta $, and the mean of the distribution, $\mu $, i.e., $\eta =g\left(\mu \right)$. The possible link functions are:

(i)exponent link: $\eta ={\mu}^{a}$, for a constant $a$,

(ii)identity link: $\eta =\mu $,

(iii)log link: $\eta =\mathrm{log}\mu $,

(iv)square root link: $\eta =\sqrt{\mu}$,

(v)reciprocal link: $\eta =\frac{1}{\mu}$.

(e)a measure of fit, the residual sum of squares $\text{}=\sum {\left({y}_{i}{\hat{\mu}}_{i}\right)}^{2}$.
The linear parameters are estimated by iterative weighted least squares. An adjusted dependent variable,
$z$, is formed:
and a working weight,
$w$,
At each iteration an approximation to the estimate of
$\beta $,
$\hat{\beta}$, is found by the weighted least squares regression of
$z$ on
$X$ with weights
$w$.
g02gaf finds a $QR$ decomposition of ${w}^{\frac{1}{2}}X$, i.e., ${w}^{\frac{1}{2}}X=QR$ where $R$ is a $p$ by $p$ triangular matrix and $Q$ is an $n$ by $p$ column orthogonal matrix.
If
$R$ is of full rank, then
$\hat{\beta}$ is the solution to
If
$R$ is not of full rank a solution is obtained by means of a singular value decomposition (SVD) of
$R$.
where
$D$ is a
$k$ by
$k$ diagonal matrix with nonzero diagonal elements,
$k$ being the rank of
$R$ and
${w}^{\frac{1}{2}}X$.
This gives the solution
${P}_{1}$ being the first
$k$ columns of
$P$, i.e.,
$P=\left({P}_{1}{P}_{0}\right)$.
The iterations are continued until there is only a small change in the residual sum of squares.
The initial values for the algorithm are obtained by taking
The fit of the model can be assessed by examining and testing the residual sum of squares, in particular comparing the difference in residual sums of squares between nested models, i.e., when one model is a submodel of the other.
Let
${\mathrm{RSS}}_{f}$ be the residual sum of squares for the full model with degrees of freedom
${\nu}_{f}$ and let
${\mathrm{RSS}}_{s}$ be the residual sum of squares for the submodel with degrees of freedom
${\nu}_{s}$ then:
has, approximately, an
$F$distribution with (
${\nu}_{s}{\nu}_{f}$),
${\nu}_{f}$ degrees of freedom.
The parameter estimates,
$\hat{\beta}$, are asymptotically Normally distributed with variancecovariance matrix:
 $C={R}^{1}{{R}^{1}}^{\mathrm{T}}{\sigma}^{2}$ in the full rank case,
 otherwise $C={P}_{1}{D}^{2}{P}_{1}^{\mathrm{T}}{\sigma}^{2}$
The residuals and influence statistics can also be examined.
The estimated linear predictor $\hat{\eta}=X\hat{\beta}$, can be written as $H{w}^{\frac{1}{2}}z$ for an $n$ by $n$ matrix $H$. The $i$th diagonal elements of $H$, ${h}_{i}$, give a measure of the influence of the $i$th values of the independent variables on the fitted regression model. These are sometimes known as leverages.
The fitted values are given by $\hat{\mu}={g}^{1}\left(\hat{\eta}\right)$.
g02gaf also computes the residuals,
$r$:
An option allows prior weights
${\omega}_{i}$ to be used; this gives a model with:
In many linear regression models the first term is taken as a mean term or an intercept, i.e.,
${x}_{\mathit{i},1}=1$, for
$\mathit{i}=1,2,\dots ,n$; this is provided as an option.
Often only some of the possible independent variables are included in a model, the facility to select variables to be included in the model is provided.
If part of the linear predictor can be represented by a variable with a known coefficient, then this can be included in the model by using an offset,
$o$:
If the model is not of full rank the solution given will be only one of the possible solutions. Other estimates may be obtained by applying constraints to the parameters. These solutions can be obtained by using
g02gkf after using
g02gaf. Only certain linear combinations of the parameters will have unique estimates; these are known as estimable functions and can be estimated and tested using
g02gnf.
Details of the SVD are made available, in the form of the matrix
${P}^{*}$:
4
References
Cook R D and Weisberg S (1982) Residuals and Influence in Regression Chapman and Hall
McCullagh P and Nelder J A (1983) Generalized Linear Models Chapman and Hall
5
Arguments

1:
$\mathbf{link}$ – Character(1)
Input

On entry: indicates which link function is to be used.
 ${\mathbf{link}}=\text{'E'}$
 An exponent link is used.
 ${\mathbf{link}}=\text{'I'}$
 An identity link is used.
 ${\mathbf{link}}=\text{'L'}$
 A log link is used.
 ${\mathbf{link}}=\text{'S'}$
 A square root link is used.
 ${\mathbf{link}}=\text{'R'}$
 A reciprocal link is used.
Constraint:
${\mathbf{link}}=\text{'E'}$, $\text{'I'}$, $\text{'L'}$, $\text{'S'}$ or $\text{'R'}$.

2:
$\mathbf{mean}$ – Character(1)
Input

On entry: indicates if a mean term is to be included.
 ${\mathbf{mean}}=\text{'M'}$
 A mean term, intercept, will be included in the model.
 ${\mathbf{mean}}=\text{'Z'}$
 The model will pass through the origin, zeropoint.
Constraint:
${\mathbf{mean}}=\text{'M'}$ or $\text{'Z'}$.

3:
$\mathbf{offset}$ – Character(1)
Input

On entry: indicates if an offset is required.
 ${\mathbf{offset}}=\text{'Y'}$
 An offset is required and the offsets must be supplied in the seventh column of v.
 ${\mathbf{offset}}=\text{'N'}$
 No offset is required.
Constraint:
${\mathbf{offset}}=\text{'Y'}$ or $\text{'N'}$.

4:
$\mathbf{weight}$ – Character(1)
Input

On entry: indicates if prior weights are to be used.
 ${\mathbf{weight}}=\text{'U'}$
 No prior weights are used.
 ${\mathbf{weight}}=\text{'W'}$
 Prior weights are used and weights must be supplied in wt.
Constraint:
${\mathbf{weight}}=\text{'U'}$ or $\text{'W'}$.

5:
$\mathbf{n}$ – Integer
Input

On entry: $n$, the number of observations.
Constraint:
${\mathbf{n}}\ge 2$.

6:
$\mathbf{x}\left({\mathbf{ldx}},{\mathbf{m}}\right)$ – Real (Kind=nag_wp) array
Input

On entry: ${\mathbf{x}}\left(\mathit{i},\mathit{j}\right)$ must contain the $\mathit{i}$th observation for the $\mathit{j}$th independent variable, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$ and $\mathit{j}=1,2,\dots ,{\mathbf{m}}$.

7:
$\mathbf{ldx}$ – Integer
Input

On entry: the first dimension of the array
x as declared in the (sub)program from which
g02gaf is called.
Constraint:
${\mathbf{ldx}}\ge {\mathbf{n}}$.

8:
$\mathbf{m}$ – Integer
Input

On entry: $m$, the total number of independent variables.
Constraint:
${\mathbf{m}}\ge 1$.

9:
$\mathbf{isx}\left({\mathbf{m}}\right)$ – Integer array
Input

On entry: indicates which independent variables are to be included in the model.
If
${\mathbf{isx}}\left(j\right)>0$, the variable contained in the
$j$th column of
x is included in the regression model.
Constraints:
 ${\mathbf{isx}}\left(\mathit{j}\right)\ge 0$, for $\mathit{j}=1,2,\dots ,{\mathbf{m}}$;
 if ${\mathbf{mean}}=\text{'M'}$, exactly ${\mathbf{ip}}1$ values of isx must be $\text{}>0$;
 if ${\mathbf{mean}}=\text{'Z'}$, exactly ip values of isx must be $\text{}>0$.

10:
$\mathbf{ip}$ – Integer
Input

On entry: the number of independent variables in the model, including the mean or intercept if present.
Constraint:
${\mathbf{ip}}>0$.

11:
$\mathbf{y}\left({\mathbf{n}}\right)$ – Real (Kind=nag_wp) array
Input

On entry: the observations on the dependent variable,
${y}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n$.

12:
$\mathbf{wt}\left(*\right)$ – Real (Kind=nag_wp) array
Input

Note: the dimension of the array
wt
must be at least
${\mathbf{n}}$ if
${\mathbf{weight}}=\text{'W'}$.
On entry: if
${\mathbf{weight}}=\text{'W'}$ wt must contain the weights to be used with the model.
If ${\mathbf{wt}}\left(i\right)=0.0$, the $i$th observation is not included in the model, in which case the effective number of observations is the number of observations with nonzero weights.
If
${\mathbf{weight}}=\text{'U'}$,
wt is not referenced and the effective number of observations is
$n$.
Constraint:
if ${\mathbf{weight}}=\text{'W'}$, ${\mathbf{wt}}\left(\mathit{i}\right)\ge 0.0$, for $\mathit{i}=1,2,\dots ,n$.

13:
$\mathbf{s}$ – Real (Kind=nag_wp)
Input/Output

On entry: the scale parameter for the model,
${\sigma}^{2}$.
If ${\mathbf{s}}=0.0$, the scale parameter is estimated with the routine using the residual mean square.
On exit: if on input
${\mathbf{s}}=0.0$,
s contains the estimated value of the scale parameter,
${\hat{\sigma}}^{2}$.
If on input
${\mathbf{s}}\ne 0.0$,
s is unchanged on exit.
Constraint:
${\mathbf{s}}\ge 0.0$.

14:
$\mathbf{a}$ – Real (Kind=nag_wp)
Input

On entry: if
${\mathbf{link}}=\text{'E'}$,
a must contain the power of the exponential.
If
${\mathbf{link}}\ne \text{'E'}$,
a is not referenced.
Constraint:
if ${\mathbf{link}}=\text{'E'}$, ${\mathbf{a}}\ne 0.0$.

On exit: the residual sum of squares for the fitted model.

16:
$\mathbf{idf}$ – Integer
Output

On exit: the degrees of freedom associated with the residual sum of squares for the fitted model.

17:
$\mathbf{b}\left({\mathbf{ip}}\right)$ – Real (Kind=nag_wp) array
Output

On exit: the estimates of the parameters of the generalized linear model,
$\hat{\beta}$.
If
${\mathbf{mean}}=\text{'M'}$,
${\mathbf{b}}\left(1\right)$ will contain the estimate of the mean parameter and
${\mathbf{b}}\left(i+1\right)$ will contain the coefficient of the variable contained in column
$j$ of
${\mathbf{x}}$, where
${\mathbf{isx}}\left(j\right)$ is the
$i$th positive value in the array
isx.
If
${\mathbf{mean}}=\text{'Z'}$,
${\mathbf{b}}\left(i\right)$ will contain the coefficient of the variable contained in column
$j$ of
${\mathbf{x}}$, where
${\mathbf{isx}}\left(j\right)$ is the
$i$th positive value in the array
isx.

18:
$\mathbf{irank}$ – Integer
Output

On exit: the rank of the independent variables.
If the model is of full rank, ${\mathbf{irank}}={\mathbf{ip}}$.
If the model is not of full rank,
irank is an estimate of the rank of the independent variables.
irank is calculated as the number of singular values greater than
${\mathbf{eps}}\times \text{}$ (largest singular value). It is possible for the SVD to be carried out but for
irank to be returned as
ip.

19:
$\mathbf{se}\left({\mathbf{ip}}\right)$ – Real (Kind=nag_wp) array
Output

On exit: the standard errors of the linear parameters.
${\mathbf{se}}\left(\mathit{i}\right)$ contains the standard error of the parameter estimate in ${\mathbf{b}}\left(\mathit{i}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{ip}}$.

20:
$\mathbf{cov}\left({\mathbf{ip}}\times \left({\mathbf{ip}}+1\right)/2\right)$ – Real (Kind=nag_wp) array
Output

On exit: the upper triangular part of the variancecovariance matrix of the
ip parameter estimates given in
b. They are stored packed by column, i.e., the covariance between the parameter estimate given in
${\mathbf{b}}\left(i\right)$ and the parameter estimate given in
${\mathbf{b}}\left(j\right)$,
$j\ge i$, is stored in
${\mathbf{cov}}\left(\left(j\times \left(j1\right)/2+i\right)\right)$.

21:
$\mathbf{v}\left({\mathbf{ldv}},{\mathbf{ip}}+7\right)$ – Real (Kind=nag_wp) array
Input/Output

On entry: if
${\mathbf{offset}}=\text{'N'}$,
v need not be set.
If ${\mathbf{offset}}=\text{'Y'}$,
${\mathbf{v}}\left(\mathit{i},7\right)$, for $\mathit{i}=1,2,\dots ,n$, must contain the offset values ${o}_{\mathit{i}}$. All other values need not be set.
On exit: auxiliary information on the fitted model.
${\mathbf{v}}\left(i,1\right)$ 
contains the linear predictor value,
${\eta}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n$. 
${\mathbf{v}}\left(i,2\right)$ 
contains the fitted value,
${\hat{\mu}}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n$. 
${\mathbf{v}}\left(i,3\right)$ 
is only included for consistency with other routines.
${\mathbf{v}}\left(\mathit{i},3\right)=1.0$, for $\mathit{i}=1,2,\dots ,n$. 
${\mathbf{v}}\left(i,4\right)$ 
contains the square root of the working weight,
${w}_{\mathit{i}}^{\frac{1}{2}}$, for $\mathit{i}=1,2,\dots ,n$. 
${\mathbf{v}}\left(i,5\right)$ 
contains the residual,
${r}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n$. 
${\mathbf{v}}\left(i,6\right)$ 
contains the leverage,
${h}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n$. 
${\mathbf{v}}\left(i,7\right)$ 
contains the offset, for $i=1,2,\dots ,n$. If ${\mathbf{offset}}=\text{'N'}$, all values will be zero. 
${\mathbf{v}}\left(i,j\right)$, 
for $j=8,\dots ,{\mathbf{ip}}+7$, contains the results of the $QR$ decomposition or the singular value decomposition. 
If the model is not of full rank, i.e.,
${\mathbf{irank}}<{\mathbf{ip}}$, the first
ip rows of columns
$8$ to
${\mathbf{ip}}+7$ contain the
${P}^{*}$ matrix.

22:
$\mathbf{ldv}$ – Integer
Input

On entry: the first dimension of the array
v as declared in the (sub)program from which
g02gaf is called.
Constraint:
${\mathbf{ldv}}\ge {\mathbf{n}}$.

23:
$\mathbf{tol}$ – Real (Kind=nag_wp)
Input

On entry: indicates the accuracy required for the fit of the model.
The iterative weighted least squares procedure is deemed to have converged if the absolute change in deviance between interactions is less than ${\mathbf{tol}}\times \left(1.0+\text{current residual sum of squares}\right)$. This is approximately an absolute precision if the residual sum of squares is small and a relative precision if the residual sum of squares is large.
If $0.0\le {\mathbf{tol}}<\mathit{machineprecision}$, g02gaf will use $10\times \mathit{machineprecision}$.
Constraint:
${\mathbf{tol}}\ge 0.0$.

24:
$\mathbf{maxit}$ – Integer
Input

On entry: the maximum number of iterations for the iterative weighted least squares.
If ${\mathbf{maxit}}=0$, a default value of $10$ is used.
Constraint:
${\mathbf{maxit}}\ge 0$.

25:
$\mathbf{iprint}$ – Integer
Input

On entry: indicates if the printing of information on the iterations is required.
 ${\mathbf{iprint}}\le 0$
 There is no printing.
 ${\mathbf{iprint}}>0$
 Every iprint iteration, the following is printed:
 the deviance,
 the current estimates,
 and if the weighted least squares equations are singular, then this is indicated.
When printing occurs the output is directed to the current advisory message unit (see
x04abf).

26:
$\mathbf{eps}$ – Real (Kind=nag_wp)
Input

On entry: the value of
eps is used to decide if the independent variables are of full rank and, if not, what is the rank of the independent variables. The smaller the value of
eps the stricter the criterion for selecting the singular value decomposition.
If $0.0\le {\mathbf{eps}}<\mathit{machineprecision}$, the routine will use machine precision instead.
Constraint:
${\mathbf{eps}}\ge 0.0$.

27:
$\mathbf{wk}\left(\left({\mathbf{ip}}\times {\mathbf{ip}}+3\times {\mathbf{ip}}+22\right)/2\right)$ – Real (Kind=nag_wp) array
Workspace


28:
$\mathbf{ifail}$ – Integer
Input/Output

On entry:
ifail must be set to
$0$,
$1$ or
$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$ or
$1$ is recommended. If message printing is undesirable, then the value
$1$ is recommended. Otherwise, the value
$1$ is recommended since useful values can be provided in some output arguments even when
${\mathbf{ifail}}\ne {\mathbf{0}}$ on exit.
When the value $\mathbf{1}$ or $\mathbf{1}$ is used it is essential to test the value of ifail on exit.
On exit:
${\mathbf{ifail}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see
Section 6).
6
Error Indicators and Warnings
If on entry
${\mathbf{ifail}}=0$ or
$1$, explanatory error messages are output on the current error message unit (as defined by
x04aaf).
Errors or warnings detected by the routine:
Note: in some cases g02gaf may return useful information.
 ${\mathbf{ifail}}=1$

On entry, ${\mathbf{a}}=0.0$ and ${\mathbf{link}}=\text{'E'}$.
Constraint: if ${\mathbf{link}}=\text{'E'}$, ${\mathbf{a}}\ne 0.0$.
On entry, ${\mathbf{eps}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{eps}}\ge 0.0$.
On entry, ${\mathbf{ip}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{ip}}\ge 1$.
On entry, ${\mathbf{ldv}}=\u2329\mathit{\text{value}}\u232a$ and ${\mathbf{n}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{ldv}}\ge {\mathbf{n}}$.
On entry, ${\mathbf{ldx}}=\u2329\mathit{\text{value}}\u232a$ and ${\mathbf{n}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{ldx}}\ge {\mathbf{n}}$.
On entry, ${\mathbf{link}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{link}}=\text{'E'}$, $\text{'I'}$, $\text{'L'}$, $\text{'S'}$ or $\text{'R'}$.
On entry, ${\mathbf{m}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{m}}\ge 1$.
On entry, ${\mathbf{maxit}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{maxit}}\ge 0$.
On entry, ${\mathbf{mean}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{mean}}=\text{'M'}$ or $\text{'Z'}$.
On entry, ${\mathbf{n}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{n}}\ge 2$.
On entry, ${\mathbf{offset}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{offset}}=\text{'Y'}$ or $\text{'N'}$.
On entry, ${\mathbf{s}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{s}}\ge 0.0$.
On entry, ${\mathbf{tol}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{tol}}\ge 0.0$.
On entry, ${\mathbf{weight}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{weight}}=\text{'W'}$ or $\text{'U'}$.
 ${\mathbf{ifail}}=2$

On entry, ${\mathbf{wt}}\left(\u2329\mathit{\text{value}}\u232a\right)<0.0$.
Constraint: ${\mathbf{wt}}\left(i\right)\ge 0.0$, for $i=1,2,\dots ,n$.
 ${\mathbf{ifail}}=3$

Number of requested xvariables greater than
n.
On entry,
ip incompatible with number of nonzero values of
isx:
${\mathbf{ip}}=\u2329\mathit{\text{value}}\u232a$.
On entry, ${\mathbf{isx}}\left(\u2329\mathit{\text{value}}\u232a\right)<0$.
Constraint: ${\mathbf{isx}}\left(j\right)\ge 0.0$, for $j=1,2,\dots ,{\mathbf{m}}$.
 ${\mathbf{ifail}}=4$

A fitted value is at a boundary. This will only occur with ${\mathbf{link}}=\text{'L'}$, $\text{'R'}$ or $\text{'E'}$. This may occur if there are small values of $y$ and the model is not suitable for the data. The model should be reformulated with, perhaps, some observations dropped.
 ${\mathbf{ifail}}=5$

SVD solution failed to converge.
 ${\mathbf{ifail}}=6$

The iterative weighted least squares has failed to converge in
maxit (or default
$10$) iterations. The value of
maxit could be increased but it may be advantageous to examine the convergence using the
iprint option. This may indicate that the convergence is slow because the solution is at a boundary in which case it may be better to reformulate the model.
 ${\mathbf{ifail}}=7$

The rank of the model has changed during the weighted least squares iterations. The estimate for $\beta $ returned may be reasonable, but you should check how the deviance has changed during iterations.
 ${\mathbf{ifail}}=8$

The degrees of freedom for error are $0$. A saturated model has been fitted.
 ${\mathbf{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.
 ${\mathbf{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.
 ${\mathbf{ifail}}=999$
Dynamic memory allocation failed.
See
Section 9 in the Introduction to the NAG Library FL Interface for further information.
7
Accuracy
The accuracy is determined by
tol as described in
Section 5. As the residual sum of squares is a function of
${\mu}^{2}$ the accuracy of the
$\hat{\beta}$ will depend on the link used and may be of the order
$\sqrt{{\mathbf{tol}}}$.
8
Parallelism and Performance
g02gaf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
g02gaf 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 implementationspecific information.
You are advised not to use
g02gaf with an identity link as
g02daf provides a more efficient way of fitting such a model.
10
Example
The model:
for a sample of five observations.
10.1
Program Text
10.2
Program Data
10.3
Program Results