NAG Library Routine Document

G01SDF

1  Purpose

2  Specification

3  Description

4  References

5  Parameters

1:     $\mathrm{LTAIL}$ – INTEGERInput

On entry: the length of the array TAIL.

Constraint: $\mathbf{LTAIL}>0$.

2:     $\mathrm{TAIL}\left(\mathbf{LTAIL}\right)$ – CHARACTER(1) arrayInput

On entry: indicates whether the lower or upper tail probabilities are required. For $j=\left(\left(\mathit{i}-1\right)\mathrm{ mod }\mathbf{LTAIL}\right)+1$, for $\mathit{i}=1,2,\dots ,\max \left(\mathbf{LTAIL},\mathbf{LF},\mathbf{LDF1},\mathbf{LDF2}\right)$:

$\mathbf{TAIL}\left(j\right)=\text{'L'}$

The lower tail probability is returned, i.e., $p_i=P\left(F_i\le f_i:u_i,v_i\right)$.

$\mathbf{TAIL}\left(j\right)=\text{'U'}$

The upper tail probability is returned, i.e., $p_i=P\left(F_i\ge f_i:u_i,v_i\right)$.

Constraint: $\mathbf{TAIL}\left(\mathit{j}\right)=\text{'L'}$ or $\text{'U'}$, for $\mathit{j}=1,2,\dots ,\mathbf{LTAIL}$.

3:     $\mathrm{LF}$ – INTEGERInput

On entry: the length of the array F.

Constraint: $\mathbf{LF}>0$.

4:     $\mathrm{F}\left(\mathbf{LF}\right)$ – REAL (KIND=nag_wp) arrayInput

On entry: $f_i$, the value of the $F$ variate with $f_i=\mathbf{F}\left(j\right)$, $j=\left(\left(i-1\right)\mathrm{ mod }\mathbf{LF}\right)+1$.

Constraint: $\mathbf{F}\left(\mathit{j}\right)\ge 0.0$, for $\mathit{j}=1,2,\dots ,\mathbf{LF}$.

5:     $\mathrm{LDF1}$ – INTEGERInput

On entry: the length of the array DF1.

Constraint: $\mathbf{LDF1}>0$.

6:     $\mathrm{DF1}\left(\mathbf{LDF1}\right)$ – REAL (KIND=nag_wp) arrayInput

On entry: $u_i$, the degrees of freedom of the numerator variance with $u_i=\mathbf{DF1}\left(j\right)$, $j=\left(\left(i-1\right)\mathrm{ mod }\mathbf{LDF1}\right)+1$.

Constraint: $\mathbf{DF1}\left(\mathit{j}\right)>0.0$, for $\mathit{j}=1,2,\dots ,\mathbf{LDF1}$.

7:     $\mathrm{LDF2}$ – INTEGERInput

On entry: the length of the array DF2.

Constraint: $\mathbf{LDF2}>0$.

8:     $\mathrm{DF2}\left(\mathbf{LDF2}\right)$ – REAL (KIND=nag_wp) arrayInput

On entry: $v_i$, the degrees of freedom of the denominator variance with $v_i=\mathbf{DF2}\left(j\right)$, $j=\left(\left(i-1\right)\mathrm{ mod }\mathbf{LDF2}\right)+1$.

Constraint: $\mathbf{DF2}\left(\mathit{j}\right)>0.0$, for $\mathit{j}=1,2,\dots ,\mathbf{LDF2}$.

9:     $\mathrm{P}\left(*\right)$ – REAL (KIND=nag_wp) arrayOutput

Note: the dimension of the array P must be at least $\max \left(\mathbf{LTAIL},\mathbf{LF},\mathbf{LDF1},\mathbf{LDF2}\right)$.

On exit: $p_i$, the probabilities for the $F$-distribution.

10:   $\mathrm{IVALID}\left(*\right)$ – INTEGER arrayOutput

Note: the dimension of the array IVALID must be at least $\max \left(\mathbf{LTAIL},\mathbf{LF},\mathbf{LDF1},\mathbf{LDF2}\right)$.

On exit: $\mathbf{IVALID}\left(i\right)$ indicates any errors with the input arguments, with

$\mathbf{IVALID}\left(i\right)=0$

No error.

$\mathbf{IVALID}\left(i\right)=1$

On entry,

invalid value supplied in TAIL when calculating $p_i$.

$\mathbf{IVALID}\left(i\right)=2$

On entry,

$f_i<0.0$.

$\mathbf{IVALID}\left(i\right)=3$

On entry,	$u_i\le 0.0$,
or	$v_i\le 0.0$.

$\mathbf{IVALID}\left(i\right)=4$

The solution has failed to converge. The result returned should represent an approximation to the solution.

11:   $\mathrm{IFAIL}$ – INTEGERInput/Output

On entry: IFAIL must be set to $0$, $-1\text{ or }1$. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value $-1\text{ 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 parameters may be useful even if $\mathbf{IFAIL}\ne \mathbf{0}$ on exit, the recommended value is $-1$. When the value $-\mathbf{1}\text{ or }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

$\mathbf{IFAIL}=1$

On entry, at least one value of F, DF1, DF2 or TAIL was invalid, or the solution failed to converge.
Check IVALID for more information.

$\mathbf{IFAIL}=2$

On entry, $\text{array size}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{LTAIL}>0$.

$\mathbf{IFAIL}=3$

On entry, $\text{array size}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{LF}>0$.

$\mathbf{IFAIL}=4$

On entry, $\text{array size}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{LDF1}>0$.

$\mathbf{IFAIL}=5$

On entry, $\text{array size}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{LDF2}>0$.

$\mathbf{IFAIL}=-99$

An unexpected error has been triggered by this routine. Please contact NAG.

See Section 3.8 in the Essential Introduction for further information.

$\mathbf{IFAIL}=-399$

Your licence key may have expired or may not have been installed correctly.

See Section 3.7 in the Essential Introduction for further information.

$\mathbf{IFAIL}=-999$

Dynamic memory allocation failed.

See Section 3.6 in the Essential Introduction for further information.

7  Accuracy

8  Parallelism and Performance

9  Further Comments

10  Example

10.1  Program Text

Program Text (g01sdfe.f90)

10.2  Program Data

Program Data (g01sdfe.d)

10.3  Program Results

Program Results (g01sdfe.r)