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

NAG Library Routine Document

G01EDF

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

G01EDF returns the probability for the lower or upper tail of the F or variance-ratio distribution with real degrees of freedom, via the routine name.

2  Specification

FUNCTION G01EDF ( TAIL, F, DF1, DF2, IFAIL)
REAL (KIND=nag_wp) G01EDF
INTEGER  IFAIL
REAL (KIND=nag_wp)  F, DF1, DF2
CHARACTER(1)  TAIL

3  Description

The lower tail probability for the F, or variance-ratio distribution, with ν1 and ν2 degrees of freedom, PFf:ν1,ν2, is defined by:
PFf:ν1,ν2=ν1ν1/2ν2ν2/2 Γ ν1+ν2/2 Γν1/2 Γν2/2 0fFν1-2/2ν1F+ν2- ν1+ν2/2dF,
for ν1, ν2>0, f0.
The probability is computed by means of a transformation to a beta distribution, PβBβ:a,b:
PFf:ν1,ν2=Pβ Bν1f ν1f+ν2 :ν1/2,ν2/2
and using a call to G01EEF.
For very large values of both ν1 and ν2, greater than 105, a normal approximation is used. If only one of ν1 or ν2 is greater than 105 then a χ2 approximation is used, see Abramowitz and Stegun (1972).

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:     TAIL – CHARACTER(1)Input
On entry: indicates whether an upper or lower tail probability is required.
TAIL='L'
The lower tail probability is returned, i.e., PFf:ν1,ν2.
TAIL='U'
The upper tail probability is returned, i.e., PFf:ν1,ν2.
Constraint: TAIL='L' or 'U'.
2:     F – REAL (KIND=nag_wp)Input
On entry: f, the value of the F variate.
Constraint: F0.0.
3:     DF1 – REAL (KIND=nag_wp)Input
On entry: the degrees of freedom of the numerator variance, ν1.
Constraint: DF1>0.0.
4:     DF2 – REAL (KIND=nag_wp)Input
On entry: the degrees of freedom of the denominator variance, ν2.
Constraint: DF2>0.0.
5:     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: G01EDF may return useful information for one or more of the following detected errors or warnings.
Errors or warnings detected by the routine:
If IFAIL=1, 2 or 3 on exit, then G01EDF returns 0.0.
IFAIL=1
On entry,TAIL'L' or 'U'.
IFAIL=2
On entry,F<0.0.
IFAIL=3
On entry,DF10.0,
orDF20.0.
IFAIL=4
F is too far out into the tails for the probability to be evaluated exactly. The result tends to approach 1.0 if f is large, or 0.0 if f is small. The result returned is a good approximation to the required solution.

7  Accuracy

The result should be accurate to five significant digits.

8  Further Comments

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

9  Example

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

9.1  Program Text

Program Text (g01edfe.f90)

9.2  Program Data

Program Data (g01edfe.d)

9.3  Program Results

Program Results (g01edfe.r)


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

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