s22be: FL CL CPP AD

NAG CL Interface
s22bec (hyperg_gauss_real)

Keyword Search:

NAG Library Manual, Mark 28.3

Interfaces: FL CL CPP AD

NAG CL 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

Settings help

CL Name Style:
Short (a00aac)
Long (impl_details)
Full (nag_info_impl_details)

1 Purpose

s22bec 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

#include <nag.h>

double

s22bec (double a, double b, double c, double x, NagError *fail)

The function may be called by the names: s22bec, nag_specfun_hyperg_gauss_real or nag_specfun_2f1_real.

3 Description

s22bec 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 function s22bfc 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 function will not compute a solution when

x > 1

The solution strategy used by this function 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 function 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 X02BBC). It should however, not be assumed that this function will produce accurate answers for all values of

a, b, c

and

x

satisfying this criterion.

This function 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$ – double Input

On entry: the parameter

a

Constraint:

| a | \leq arbnd

2: $b$ – double Input

On entry: the parameter

b

Constraint:

| b | \leq arbnd

3: $c$ – double Input

On entry: the parameter

c

Constraints:

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

4: $x$ – double Input

On entry: the argument

x

Constraint:

- arbnd < x \leq 1

5: $fail$ – NagError * Input/Output

The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6 Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_CANNOT_CALCULATE: An internal calculation has resulted in an undefined result.
NE_COMPLEX: On entry, $x = ⟨ value ⟩$ .
In general, ${}_{2}F_{1} (a, b; c; x)$ is not real valued when $x > 1$ .
NE_INFINITE: 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$ .
NE_INTERNAL_ERROR: An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_NO_LICENCE: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.
NE_OVERFLOW: Overflow occurred in a subcalculation of ${}_{2}F_{1} (a, b; c; x)$ . The result may or may not be infinite.
NE_REAL: On entry, $c = ⟨ value ⟩$ .
${}_{2}F_{1} (a, b; c; x)$ is undefined when $c$ is zero or a negative integer.
NE_REAL_RANGE_CONS: On entry, a does not satisfy $| a | \leq arbnd = ⟨ value ⟩$ .

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

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

On entry, x does not satisfy $| x | \leq arbnd = ⟨ value ⟩$ .
NE_TOTAL_PRECISION_LOSS: All approximations have completed, and the final residual estimate indicates no accuracy can be guaranteed.
$Relative residual = ⟨ value ⟩$ .
NW_OVERFLOW_WARN: On completion, overflow occurred in the evaluation of ${}_{2}F_{1} (a, b; c; x)$ .
NW_SOME_PRECISION_LOSS: All approximations have completed, and the final residual estimate indicates some precision may have been lost.
$Relative residual = ⟨ value ⟩$ .
NW_UNDERFLOW_WARN: Underflow occurred during the evaluation of ${}_{2}F_{1} (a, b; c; x)$ . The returned value may be inaccurate.

7 Accuracy

In general, if

fail . code =

NE_NOERROR, 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 different fail.code will be returned. Specifically,

$fail . code =$ NE_NOERROR or NW_UNDERFLOW_WARN	$res \leq 1000 ε$
$fail . code =$ NW_SOME_PRECISION_LOSS	$1000 ε < res \leq 0.1$
$fail . code =$ NE_TOTAL_PRECISION_LOSS	$res > 0.1$

where

ε

is the machine precision as returned by X02AJC.

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 s22bfc, which requires you to supply the correct decimal fraction.

8 Parallelism and Performance

s22bec is not threaded in any implementation.

9 Further Comments

s22bec 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 fail, as detailed in the following cases.

fail . code =

NE_NOERROR, or

fail . code =

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

fail . code =

NE_INFINITE 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.

fail . code =

NW_OVERFLOW_WARN then upon completion,

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

, where

R_{\max}

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

fail . code =

NE_OVERFLOW 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, s22bec will return a signalling NaN (see x07bbc).

fail . code =

NE_CANNOT_CALCULATE 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.

fail . code =

NE_REAL 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.