Integer, Intent (In)	::	ilog, lx, la, lb
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	ivalid(*)
Real (Kind=nag_wp), Intent (In)	::	x(lx), a(la), b(lb)
Real (Kind=nag_wp), Intent (Out)	::	pdf(*)

C Header Interface

#include <nag.h>

void	g01kkf_ (const Integer ilog, const Integer lx, const double x[], const Integer la, const double a[], const Integer lb, const double b[], double pdf[], Integer ivalid[], Integer *ifail)

The routine may be called by the names g01kkf or nagf_stat_pdf_gamma_vector.

3 Description

The gamma distribution with shape parameter

α_{i}

and scale parameter

β_{i}

has PDF

\begin{matrix} f (x_{i}, α_{i}, β_{i}) = \frac{1}{{β_{i}}^{α_{i}} Γ (α_{i})} {x_{i}}^{α_{i} - 1} e^{- x_{i} / β_{i}} & if ​ x_{i} \geq 0; α_{i}, β_{i} > 0 \\ f (x_{i}, α_{i}, β_{i}) = 0 & otherwise. \end{matrix}

0.01 \leq x_{i}, α_{i}, β_{i} \leq 100

then an algorithm based directly on the gamma distribution's PDF is used. For values outside this range, the function is calculated via the Poisson distribution's PDF as described in Loader (2000) (see Section 9).

The input arrays to this routine are designed to allow maximum flexibility in the supply of vector arguments 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

Loader C (2000) Fast and accurate computation of binomial probabilities (not yet published)

5 Arguments

1: $ilog$ – Integer Input

On entry: the value of ilog determines whether the logarithmic value is returned in pdf.

$ilog = 0$: $f (x_{i}, α_{i}, β_{i})$ , the probability density function is returned.
$ilog = 1$: $\log (f (x_{i}, α_{i}, β_{i}))$ , the logarithm of the probability density function is returned.

Constraint:

ilog = 0

1

2: $lx$ – Integer Input

On entry: the length of the array x.

Constraint:

lx > 0

3: $x (lx)$ – Real (Kind=nag_wp) array Input

On entry:

x_{i}

, the values at which the PDF is to be evaluated with

x_{i} = x (j)

j = ((i - 1) mod lx) + 1

, for

i = 1, 2, \dots, \max (lx, la, lb)

4: $la$ – Integer Input

On entry: the length of the array a.

Constraint:

la > 0

5: $a (la)$ – Real (Kind=nag_wp) array Input

On entry:

α_{i}

, the shape parameter with

α_{i} = a (j)

j = ((i - 1) mod la) + 1

Constraint:

a (j) > 0.0

, for

j = 1, 2, \dots, la

6: $lb$ – Integer Input

On entry: the length of the array b.

Constraint:

lb > 0

7: $b (lb)$ – Real (Kind=nag_wp) array Input

On entry:

β_{i}

, the scale parameter with

β_{i} = b (j)

j = ((i - 1) mod lb) + 1

Constraint:

b (j) > 0.0

, for

j = 1, 2, \dots, lb

8: $pdf (*)$ – Real (Kind=nag_wp) array Output

Note: the dimension of the array pdf must be at least

\max (lx, la, lb)

On exit:

f (x_{i}, α_{i}, β_{i})

\log (f (x_{i}, α_{i}, β_{i}))

9: $ivalid (*)$ – Integer array Output

Note: the dimension of the array ivalid must be at least

\max (lx, la, lb)

On exit:

ivalid (i)

indicates any errors with the input arguments, with

$ivalid (i) = 0$: No error.
$ivalid (i) = 1$: $α_{i} \leq 0.0$ .
$ivalid (i) = 2$: $β_{i} \leq 0.0$ .
$ivalid (i) = 3$: $\frac{x_{i}}{β_{i}}$ overflows, the value returned should be a reasonable approximation.

10: $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, at least one value of x, a or b was invalid.
Check ivalid for more information.

$ifail = 2$: On entry, $ilog = ⟨ value ⟩$ .
Constraint: $ilog = 0$ or $1$ .

$ifail = 3$: On entry, $array size = ⟨ value ⟩$ .
Constraint: $lx > 0$ .

$ifail = 4$: On entry, $array size = ⟨ value ⟩$ .
Constraint: $la > 0$ .

$ifail = 5$: On entry, $array size = ⟨ value ⟩$ .
Constraint: $lb > 0$ .

$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

g01kkf is not threaded in any implementation.

9 Further Comments

Due to the lack of a stable link to Loader (2000) paper, we give a brief overview of the method, as applied to the Poisson distribution. The Poisson distribution has a continuous mass function given by,

p (x; λ) = \frac{λ^{x}}{x!} e^{- λ} .

(1)

The usual way of computing this quantity would be to take the logarithm and calculate,

\log (p (x; λ)) = x \log λ - \log (x!) - λ .

For large

x

and

λ

x \log λ

and

\log (x!)

are very large, of the same order of magnitude and when calculated have rounding errors. The subtraction of these two terms can, therefore, result in a number, many orders of magnitude smaller and hence we lose accuracy due to subtraction errors. For example for

x = 2 \times 10^{6}

and

λ = 2 \times 10^{6}

\log (x!) \approx 2.7 \times 10^{7}

and

\log (p (x; λ)) = - 8.17326744645834

. But calculated with the method shown later we have

\log (p (x; λ)) = - 8.1732674441334492

. The difference between these two results suggests a loss of about

7

significant figures of precision.

Loader introduces an alternative way of expressing (1) based on the saddle point expansion,

\log (p (x; λ)) = \log (p (x; x)) - D (x; λ),

(2)

where

D (x; λ)

, the deviance for the Poisson distribution is given by,

\begin{matrix} D (x; λ) & = & \log (p (x; x)) - \log (p (x; λ)), \\ = & λ D_{0} (\frac{x}{λ}), \end{matrix}

(3)

and

D_{0} (ε) = ε \log ε + 1 - ε .

For

ε

close to

1

D_{0} (ε)

can be evaluated through the series expansion

λ D_{0} (\frac{x}{λ}) = \frac{{(x - λ)}^{2}}{x + λ} + 2 x \sum_{j = 1}^{\infty} \frac{v^{2 j + 1}}{2 j + 1},   where ​ v = \frac{x - λ}{x + λ},

otherwise

D_{0} (ε)

can be evaluated directly. In addition, Loader suggests evaluating

\log (x!)

using the Stirling–De Moivre series,

\log (x!) = \frac{1}{2} \log (2 π x) + x \log (x) - x + δ (x),

(4)

where the error

δ (x)

is given by

δ (x) = \frac{1}{12 x} - \frac{1}{{360 x}^{3}} + \frac{1}{{1260 x}^{5}} + O (x^{−7}) .

Finally

\log (p (x; λ))

can be evaluated by combining equations (1)–(4) to get,

p (x; λ) = \frac{1}{\sqrt{2 π x}} e^{- δ (x) - λ D_{0} (x / λ)} .

10 Example

This example prints the value of the gamma distribution PDF at six different points

x_{i}

with differing

α_{i}

and

β_{i}

g01kk: FL CL CPP AD

NAG FL Interfaceg01kkf (pdf_​gamma_​vector)

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

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
g01kkf (pdf_gamma_vector)