s22be: FL CL CPP AD

NAG FL Interface
s22bef (hyperg_gauss_real)

Keyword Search:

NAG Library Manual, Mark 27.1

Interfaces: FL CL CPP AD

NAG FL Interface Introduction

S (Specfun) Chapter Contents

S (Specfun) Chapter Introduction

s22be: FL CL CPP AD

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

1 Purpose

s22bef returns a value for the Gauss hypergeometric function

{}_{2}F_{1} (a, b; c; x)

for real parameters

a, b

and

c

, and real argument

x

2 Specification

Fortran Interface

Function s22bef (

a, b, c, x, ifail)

Real (Kind=nag_wp)	::	s22bef
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	a, b, c, x

C Header Interface

#include <nag.h>

double

s22bef_ (const double *a, const double *b, const double *c, const double *x, Integer *ifail)

The routine may be called by the names s22bef or nagf_specfun_hyperg_gauss_real.

3 Description

s22bef returns a value for the Gauss hypergeometric function

{}_{2}F_{1} (a, b; c; x)

for real parameters

a

b

and

c

, and for real argument

x

The associated routine s22bff performs the same operations, but returns

{}_{2}F_{1} (a, b; c; x)

in the scaled form

{}_{2}F_{1} (a, b; c; x) = f_{fr} \times 2^{f_{sc}}

to allow calculations to be performed when

{}_{2}F_{1} (a, b; c; x)

is not representable as a single working precision number. It also accepts the parameters

a

b

and

c

as summations of an integer and a decimal fraction, giving higher accuracy when any are close to an integer.

The Gauss hypergeometric function is a solution to the hypergeometric differential equation,

x (1 - x) \frac{d^{2} f}{d x^{2}} + (c - (a + b + 1) x) \frac{d f}{d x} - a b f = 0 .

(1)

For

| x | < 1

, it may be defined by the Gauss series,

{}_{2}F_{1} (a, b; c; x) = \sum_{s = 0}^{\infty} \frac{{(a)}_{s} {(b)}_{s}}{{(c)}_{s} s!} x^{s} = 1 + \frac{a b}{c} x + \frac{a (a + 1) b (b + 1)}{c (c + 1) 2!} x^{2} + \dots,

(2)

where

{(a)}_{s} = 1 (a) (a + 1) (a + 2) \dots (a + s - 1)

is the rising factorial of

a

{}_{2}F_{1} (a, b; c; x)

is undefined for

c = 0

c

a negative integer.

For

| x | < 1

, the series is absolutely convergent and

{}_{2}F_{1} (a, b; c; x)

is finite.

For

x < 1

, linear transformations of the form,

{}_{2}F_{1} (a, b; c; x) = C_{1} (a_{1}, b_{1}, c_{1}, x_{1}) {}_{2}F_{1} (a_{1}, b_{1}; c_{1}; x_{1}) + C_{2} (a_{2}, b_{2}, c_{2}, x_{2}) {}_{2}F_{1} (a_{2}, b_{2}; c_{2}; x_{2})

(3)

exist, where

x_{1}

x_{2} \in (0, 1]

C_{1}

and

C_{2}

are real valued functions of the parameters and argument, typically involving products of gamma functions. When these are degenerate, finite limiting cases exist. Hence for

x < 0

{}_{2}F_{1} (a, b; c; x)

is defined by analytic continuation, and for

x < 1

{}_{2}F_{1} (a, b; c; x)

is real and finite.

For

x = 1

, the following apply:

If $c > a + b$ , ${}_{2}F_{1} (a, b; c; 1) = \frac{Γ (c) Γ (c - a - b)}{Γ (c - a) Γ (c - b)}$ , and hence is finite. Solutions also exist for the degenerate cases where $c - a$ or $c - b$ are negative integers or zero.
If $c \leq a + b$ , ${}_{2}F_{1} (a, b; c; 1)$ is infinite, and the sign of ${}_{2}F_{1} (a, b; c; 1)$ is determinable as $x$ approaches $1$ from below.

In the complex plane, the principal branch of

{}_{2}F_{1} (a, b; c; z)

is taken along the real axis from

x = 1.0

increasing.

{}_{2}F_{1} (a, b; c; z)

is multivalued along this branch, and for real parameters

a, b

and

c

is typically not real valued. As such, this routine will not compute a solution when

x > 1

The solution strategy used by this routine is primarily dependent upon the value of the argument

x

. Once trivial cases and the case

x = 1.0

are eliminated, this proceeds as follows.

For

0 < x \leq 0.5

, sets of safe parameters

{α_{i, j}; β_{i, j}; ζ_{i, j}; χ_{j} | 1 \leq j \leq 2 |; 1 \leq i \leq 4}

are determined, such that the values of

{}_{2}F_{1} (a_{j}, b_{j}; c_{j}; x_{j})

required for an appropriate transformation of the type (3) may be calculated either directly or using recurrence relations from the solutions of

{}_{2}F_{1} (α_{i, j}, β_{i, j}; ζ_{i, j}; χ_{j})

. If

c

is positive, then only transformations with

C_{2} = 0.0

will be used, implying only

{}_{2}F_{1} (a_{1}, b_{1}; c_{1}; x_{1})

will be required, with the transformed argument

x_{1} = x

. If

c

is negative, in some cases a transformation with

C_{2} \neq 0.0

will be used, with the argument

x_{2} = 1.0 - x

. The routine then cycles through these sets until acceptable solutions are generated. If no computation produces an accurate answer, the least inaccurate answer is selected to complete the computation. See Section 7.

For

0.5 < x < 1.0

, an identical approach is first used with the argument

x

. Should this fail, a linear transformation resulting in both transformed arguments satisfying

x_{j} = 1.0 - x

is employed, and the above strategy for

0 < x \leq 0.5

is utilized on both components. Further transformations in these sub-computations are however, limited to single terms with no argument transformation.

For

x < 0

, a linear transformation mapping the argument

x

to the interval

(0, 0.5]

is first employed. The strategy for

0 < x \leq 0.5

is then used on each component, including possible further two term transforms. To avoid some degenerate cases, a transform mapping the argument

x

[0.5, 1)

may also be used.

In addition to the above restrictions on

c

and

x

, an artificial bound, arbnd, is placed on the magnitudes of

a, b, c

and

x

to minimize the occurrence of overflow in internal calculations, particularly those involving real to integer conversions.

arbnd = 0.0001 \times I_{\max}

, where

I_{\max}

is the largest machine integer (see x02bbf). It should however, not be assumed that this routine will produce accurate answers for all values of

a, b, c

and

x

satisfying this criterion.

This routine also tests for non-finite values of the parameters and argument on entry, and assigns non-finite values upon completion if appropriate. See Section 9 and Chapter X07.

Please consult the NIST Digital Library of Mathematical Functions for a detailed discussion of the Gauss hypergeometric function including special cases, transformations, relations and asymptotic approximations.

4 References

NIST Digital Library of Mathematical Functions

Pearson J (2009) Computation of hypergeometric functions MSc Dissertation, Mathematical Institute, University of Oxford

5 Arguments

1: $a$ – Real (Kind=nag_wp) Input

On entry: the parameter

a

Constraint:

| a | \leq arbnd

2: $b$ – Real (Kind=nag_wp) Input

On entry: the parameter

b

Constraint:

| b | \leq arbnd

3: $c$ – Real (Kind=nag_wp) Input

On entry: the parameter

c

Constraints:

$| c | \leq arbnd$ ;
$c \neq 0, - 1, - 2, \dots$ .

4: $x$ – Real (Kind=nag_wp) Input

On entry: the argument

x

Constraint:

- arbnd < x \leq 1

5: $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$: Underflow occurred during the evaluation of ${}_{2}F_{1} (a, b; c; x)$ . The returned value may be inaccurate.

$ifail = 2$: All approximations have completed, and the final residual estimate indicates some precision may have been lost.
$Relative residual = ⟨ value ⟩$ .

$ifail = 3$: All approximations have completed, and the final residual estimate indicates no accuracy can be guaranteed.
$Relative residual = ⟨ value ⟩$ .

$ifail = 4$: On entry, $x = ⟨ value ⟩$ , $c = ⟨ value ⟩$ , $a + b = ⟨ value ⟩$ .
${}_{2}F_{1} (a, b; c; 1)$ is infinite in the case $c \leq a + b$ .

$ifail = 5$: On completion, overflow occurred in the evaluation of ${}_{2}F_{1} (a, b; c; x)$ .

$ifail = 6$: Overflow occurred in a subcalculation of ${}_{2}F_{1} (a, b; c; x)$ . The result may or may not be infinite.

$ifail = 9$: An internal calculation has resulted in an undefined result.

$ifail = 11$: On entry, a does not satisfy $| a | \leq arbnd = ⟨ value ⟩$ .

$ifail = 21$: On entry, b does not satisfy $| b | \leq arbnd = ⟨ value ⟩$ .

$ifail = 31$: On entry, c does not satisfy $| c | \leq arbnd = ⟨ value ⟩$ .

$ifail = 32$: On entry, $c = ⟨ value ⟩$ .
${}_{2}F_{1} (a, b; c; x)$ is undefined when $c$ is zero or a negative integer.

$ifail = 41$: On entry, x does not satisfy $| x | \leq arbnd = ⟨ value ⟩$ .

$ifail = 42$: On entry, $x = ⟨ value ⟩$ .
In general, ${}_{2}F_{1} (a, b; c; x)$ is not real valued when $x > 1$ .

$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

In general, if

ifail = 0

, the value of

{}_{2}F_{1} (a, b; c; x)

may be assumed accurate, with the possible loss of one or two decimal places. Assuming the result does not under or overflow, an error estimate

res

is made internally using equation (1). If the magnitude of

res

is sufficiently large, a nonzero ifail will be returned. Specifically,

$ifail = 0$ or $1$	$res \leq 1000 ε$
$ifail = 2$	$1000 ε < res \leq 0.1$
$ifail = 3$	$res > 0.1$

where

ε

is the machine precision as returned by x02ajf.

A further estimate of the residual can be constructed using equation (1), and the differential identity,

\begin{matrix} \frac{d ({}_{2}F_{1} (a, b; c; x))}{d x} = \frac{a b}{c} {}_{2}F_{1} (a + 1, b + 1; c + 1; x) \\ \frac{d^{2} ({}_{2}F_{1} (a, b; c; x))}{d x^{2}} = \frac{a (a + 1) b (b + 1)}{c (c + 1)} {}_{2}F_{1} (a + 2, b + 2; c + 2; x) \end{matrix}

(4)

This estimate is however, dependent upon the error involved in approximating

{}_{2}F_{1} (a + 1, b + 1; c + 1; x)

and

{}_{2}F_{1} (a + 2, b + 2; c + 2; x)

Furthermore, the accuracy of the solution, and the error estimate, can be dependent upon the accuracy of the decimal fraction of the input parameters

a

and

b

. For example, if

c = c_{i} + c_{r} = 100 + 1.0E−6

, then on a machine with

16

decimal digits of precision, the internal calculation of

c_{r}

will only be accurate to

8

decimal places. This can subsequently pollute the final solution by several decimal places without affecting the residual estimate as greatly. Should you require higher accuracy in such regions, then you should use s22bff, which requires you to supply the correct decimal fraction.

8 Parallelism and Performance

s22bef is not threaded in any implementation.

9 Further Comments

s22bef returns non-finite values when appropriate. See Chapter X07 for more information on the definitions of non-finite values.

Should a non-finite value be returned, this will be indicated in the value of ifail, as detailed in the following cases.

ifail = 0

, or

ifail = 1

2

3

, a finite value will have been returned with an approximate accuracy as detailed in Section 7.

ifail = 4

then

{}_{2}F_{1} (a, b; c; x)

is infinite, and a signed infinity will have been returned. The sign of the infinity should be correct when taking the limit as

x

approaches

1

from below.

ifail = 5

then upon completion,

| {}_{2}F_{1} (a, b; c; x) | > R_{\max}

, where

R_{\max}

is the largest machine number given by x02alf, and hence is too large to be representable. The result will be returned as a signed infinity. The sign should be correct.

ifail = 6

then overflow occurred during a subcalculation of

{}_{2}F_{1} (a, b; c; x)

. A signed infinity will have been returned, however, there is no guarantee that this is representative of either the magnitude or the sign of

{}_{2}F_{1} (a, b; c; x)

For all other error exits, s22bef will return a signalling NaN (see x07bbf).

ifail = 9

then an internal computation produced an undefined result. This may occur when two terms overflow with opposite signs, and the result is dependent upon their summation for example.

ifail = 32

then

c

is too close to a negative integer or zero on entry, and

{}_{2}F_{1} (a, b; c; x)

is considered undefined. Note, this will also be the case when

c

is a negative integer, and a (possibly trivial) linear transformation of the form (3) would result in either:

(i)all $c_{j}$ not being negative integers,
(ii)for any $c_{j}$ which remain as negative integers, one of the corresponding parameters $a_{j}$ or $b_{j}$ is a negative integer of magnitude less than $c_{j}$ .

In the first case, the transformation coefficients

C_{j} (a_{j}, b_{j}, c_{j}, x_{j})

are typically either infinite or undefined, preventing a solution being constructed. In the second case, the series (2) will terminate before the degenerate term, resulting in a polynomial of fixed degree, and hence potentially a finite solution.

ifail = 11

21

31

41

then no computation will have been performed. The actual solution may however, be finite.

ifail = 42

indicates

x > 1

. Hence the requested solution is on the boundary of the principal branch of

{}_{2}F_{1} (a, b; c; x)

, and hence is multivalued, typically with a nonzero imaginary component. It is however, strictly finite.

10 Example

This example evaluates

{}_{2}F_{1} (a, b; c; x)

at a fixed set of parameters

a, b

and

c

, and for several values for the argument

x

10.1 Program Text

Program Text (s22befe.f90)

10.2 Program Data

None.

10.3 Program Results

Program Results (s22befe.r)

NAG Library Manual, Mark 27.1

Interfaces: FL CL CPP AD

NAG FL Interface Introduction

S (Specfun) Chapter Contents

S (Specfun) Chapter Introduction

s22be: FL CL CPP AD

NAG FL Interfaces22bef (hyperg_​gauss_​real)

▸▿ 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
s22bef (hyperg_gauss_real)