G01SDF (PDF version)
G01 Chapter Contents
G01 Chapter Introduction
NAG Library Manual

NAG Library Routine Document

G01SDF

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

 Contents

    1  Purpose
    7  Accuracy

1  Purpose

G01SDF returns a number of lower or upper tail probabilities for the F or variance-ratio distribution with real degrees of freedom.

2  Specification

SUBROUTINE G01SDF ( LTAIL, TAIL, LF, F, LDF1, DF1, LDF2, DF2, P, IVALID, IFAIL)
INTEGER  LTAIL, LF, LDF1, LDF2, IVALID(*), IFAIL
REAL (KIND=nag_wp)  F(LF), DF1(LDF1), DF2(LDF2), P(*)
CHARACTER(1)  TAIL(LTAIL)

3  Description

The lower tail probability for the F, or variance-ratio, distribution with ui and vi degrees of freedom, P Fi fi :ui,vi , is defined by:
P Fi fi :ui,vi = ui ui/2 vi vi/2 Γ ui + vi / 2 Γ ui/2 Γ vi/2 0 fi Fi ui-2 / 2 ui Fi + vi - ui + vi / 2 d Fi ,  
for ui, vi>0, fi0.
The probability is computed by means of a transformation to a beta distribution, Pβi Bi βi :ai,bi :
P Fi fi :ui,vi = Pβi Bi ui fi ui fi + vi : ui / 2 , vi / 2  
and using a call to G01EEF.
For very large values of both ui and vi, greater than 105, a normal approximation is used. If only one of ui or vi is greater than 105 then a χ2 approximation is used, see Abramowitz and Stegun (1972).
The input arrays to this routine are designed to allow maximum flexibility in the supply of vector parameters by re-using elements of any arrays that are shorter than the total number of evaluations required. See Section 2.6 in the G01 Chapter Introduction for further information.

4  References

Abramowitz M and Stegun I A (1972) Handbook of Mathematical Functions (3rd Edition) Dover Publications
Hastings N A J and Peacock J B (1975) Statistical Distributions Butterworth

5  Parameters

1:     LTAIL – INTEGERInput
On entry: the length of the array TAIL.
Constraint: LTAIL>0.
2:     TAILLTAIL – CHARACTER(1) arrayInput
On entry: indicates whether the lower or upper tail probabilities are required. For j= i-1 mod LTAIL +1 , for i=1,2,,maxLTAIL,LF,LDF1,LDF2:
TAILj='L'
The lower tail probability is returned, i.e., pi = P Fi fi :ui,vi .
TAILj='U'
The upper tail probability is returned, i.e., pi = P Fi fi :ui,vi .
Constraint: TAILj='L' or 'U', for j=1,2,,LTAIL.
3:     LF – INTEGERInput
On entry: the length of the array F.
Constraint: LF>0.
4:     FLF – REAL (KIND=nag_wp) arrayInput
On entry: fi, the value of the F variate with fi=Fj, j=i-1 mod LF+1.
Constraint: Fj0.0, for j=1,2,,LF.
5:     LDF1 – INTEGERInput
On entry: the length of the array DF1.
Constraint: LDF1>0.
6:     DF1LDF1 – REAL (KIND=nag_wp) arrayInput
On entry: ui, the degrees of freedom of the numerator variance with ui=DF1j, j=i-1 mod LDF1+1.
Constraint: DF1j>0.0, for j=1,2,,LDF1.
7:     LDF2 – INTEGERInput
On entry: the length of the array DF2.
Constraint: LDF2>0.
8:     DF2LDF2 – REAL (KIND=nag_wp) arrayInput
On entry: vi, the degrees of freedom of the denominator variance with vi=DF2j, j=i-1 mod LDF2+1.
Constraint: DF2j>0.0, for j=1,2,,LDF2.
9:     P* – REAL (KIND=nag_wp) arrayOutput
Note: the dimension of the array P must be at least maxLTAIL,LF,LDF1,LDF2.
On exit: pi, the probabilities for the F-distribution.
10:   IVALID* – INTEGER arrayOutput
Note: the dimension of the array IVALID must be at least maxLTAIL,LF,LDF1,LDF2.
On exit: IVALIDi indicates any errors with the input arguments, with
IVALIDi=0
No error.
IVALIDi=1
On entry,invalid value supplied in TAIL when calculating pi.
IVALIDi=2
On entry,fi<0.0.
IVALIDi=3
On entry,ui0.0,
orvi0.0.
IVALIDi=4
The solution has failed to converge. The result returned should represent an approximation to the solution.
11:   IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to 0, -1​ 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​ 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 IFAIL0 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 or -1, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Note: G01SDF 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, at least one value of F, DF1, DF2 or TAIL was invalid, or the solution failed to converge.
Check IVALID for more information.
IFAIL=2
On entry, array size=value.
Constraint: LTAIL>0.
IFAIL=3
On entry, array size=value.
Constraint: LF>0.
IFAIL=4
On entry, array size=value.
Constraint: LDF1>0.
IFAIL=5
On entry, array size=value.
Constraint: LDF2>0.
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.
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.
IFAIL=-999
Dynamic memory allocation failed.
See Section 3.6 in the Essential Introduction for further information.

7  Accuracy

The result should be accurate to five significant digits.

8  Parallelism and Performance

Not applicable.

9  Further Comments

For higher accuracy G01SEF can be used along with the transformations given in Section 3.

10  Example

This example reads values from, and degrees of freedom for, a number of F-distributions and computes the associated lower tail probabilities.

10.1  Program Text

Program Text (g01sdfe.f90)

10.2  Program Data

Program Data (g01sdfe.d)

10.3  Program Results

Program Results (g01sdfe.r)


G01SDF (PDF version)
G01 Chapter Contents
G01 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2015