d01tcf returns the weights (normal or adjusted) and abscissae for a Gaussian integration rule with a specified number of abscissae. Six different types of Gauss rule are allowed.

2 Specification

Fortran Interface

Subroutine d01tcf (

itype, a, b, c, d, n, weight, abscis, ifail)

Integer, Intent (In)	::	itype, n
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	a, b, c, d
Real (Kind=nag_wp), Intent (Out)	::	weight(n), abscis(n)

C Header Interface

#include <nag.h>

void	d01tcf_ (const Integer itype, const double a, const double b, const double c, const double d, const Integer n, double weight[], double abscis[], Integer *ifail)

The routine may be called by the names d01tcf or nagf_quad_dim1_gauss_wgen.

3 Description

d01tcf returns the weights

w_{i}

and abscissae

x_{i}

for use in the summation

S = \sum_{i = 1}^{n} w_{i} f (x_{i}),

which approximates a definite integral (see Davis and Rabinowitz (1975) or Stroud and Secrest (1966)). The following types are provided:

(a)Gauss–Legendre

$S ≃ \int_{a}^{b} f (x) d x, exact for f (x) = P_{2 n - 1} (x) .$

Constraint: $b > a$ .
(b)Gauss–Jacobi
normal weights:

$S ≃ \int_{a}^{b} {(b - x)}^{c} {(x - a)}^{d} f (x) d x, exact for f (x) = P_{2 n - 1} (x),$

adjusted weights:

$S ≃ \int_{a}^{b} f (x) d x, exact for f (x) = {(b - x)}^{c} {(x - a)}^{d} P_{2 n - 1} (x) .$

Constraint: $c > −1$ , $d > −1$ , $b > a$ .
(c)Exponential Gauss
normal weights:

$S ≃ \int_{a}^{b} {| x - \frac{a + b}{2} |}^{c} f (x) d x, exact for f (x) = P_{2 n - 1} (x),$

adjusted weights:

$S ≃ \int_{a}^{b} f (x) d x, exact for f (x) = {| x - \frac{a + b}{2} |}^{c} P_{2 n - 1} (x) .$

Constraint: $c > −1$ , $b > a$ .
(d)Gauss–Laguerre
normal weights:

$\begin{array}{l} S & ≃ \int_{a}^{\infty} {| x - a |}^{c} e^{- b x} f (x) d x (b > 0), \\ ≃ \int_{- \infty}^{a} {| x - a |}^{c} e^{- b x} f (x) d x (b < 0), exact for f (x) = P_{2 n - 1} (x), \end{array}$

adjusted weights:

$\begin{array}{l} S & ≃ \int_{a}^{\infty} f (x) d x (b > 0), \\ ≃ \int_{- \infty}^{a} f (x) d x (b < 0), exact for f (x) = {| x - a |}^{c} e^{- b x} P_{2 n - 1} (x) . \end{array}$

Constraint: $c > −1$ , $b \neq 0$ .
(e)Gauss–Hermite
normal weights:

$S ≃ \int_{- \infty}^{+ \infty} {| x - a |}^{c} e^{- b {(x - a)}^{2}} f (x) d x, exact for f (x) = P_{2 n - 1} (x),$

adjusted weights:

$S ≃ \int_{- \infty}^{+ \infty} f (x) d x, exact for f (x) = {| x - a |}^{c} e^{- b {(x - a)}^{2}} P_{2 n - 1} (x) .$

Constraint: $c > −1$ , $b > 0$ .
(f)Rational Gauss
normal weights:

$\begin{array}{l} S & ≃ \int_{a}^{\infty} \frac{{| x - a |}^{c}}{{| x + b |}^{d}} f (x) d x (a + b > 0), \\ ≃ \int_{- \infty}^{a} \frac{{| x - a |}^{c}}{{| x + b |}^{d}} f (x) d x (a + b < 0), exact for f (x) = P_{2 n - 1} (\frac{1}{x + b}), \end{array}$

adjusted weights:

$\begin{array}{l} S & ≃ \int_{a}^{\infty} f (x) d x (a + b > 0), \\ ≃ \int_{- \infty}^{a} f (x) d x (a + b < 0), exact for f (x) = \frac{{| x - a |}^{c}}{{| x + b |}^{d}} P_{2 n - 1} (\frac{1}{x + b}) . \end{array}$

Constraint: $c > −1$ , $d > c + 1$ , $a + b \neq 0$ .

In the above formulae,

P_{2 n - 1} (x)

stands for any polynomial of degree

2 n - 1

or less in

x

The method used to calculate the abscissae involves finding the eigenvalues of the appropriate tridiagonal matrix (see Golub and Welsch (1969)). The weights are then determined by the formula

w_{i} = {\sum_{j = 0}^{n - 1} P_{j}^{*} {(x_{i})}^{2}}^{−1},

where

P_{j}^{*} (x)

is the

j

th orthogonal polynomial with respect to the weight function over the appropriate interval.

The weights and abscissae produced by d01tcf may be passed to d01fbf, which will evaluate the summations in one or more dimensions.

4 References

Davis P J and Rabinowitz P (1975) Methods of Numerical Integration Academic Press

Golub G H and Welsch J H (1969) Calculation of Gauss quadrature rules Math. Comput. 23 221–230

Stroud A H and Secrest D (1966) Gaussian Quadrature Formulas Prentice–Hall

5 Arguments

1: $itype$ – Integer Input

On entry: indicates the type of quadrature rule.

$itype = 0$: Gauss–Legendre, with normal weights.
$itype = 1$: Gauss–Jacobi, with normal weights.
$itype = −1$: Gauss–Jacobi, with adjusted weights.
$itype = 2$: Exponential Gauss, with normal weights.
$itype = −2$: Exponential Gauss, with adjusted weights.
$itype = 3$: Gauss–Laguerre, with normal weights.
$itype = −3$: Gauss–Laguerre, with adjusted weights.
$itype = 4$: Gauss–Hermite, with normal weights.
$itype = −4$: Gauss–Hermite, with adjusted weights.
$itype = 5$: Rational Gauss, with normal weights.
$itype = −5$: Rational Gauss, with adjusted weights.

Constraint:

itype = 0

1

−1

2

−2

3

−3

4

−4

5

−5

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

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

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

5: $d$ – Real (Kind=nag_wp) Input

On entry: the parameters

a

b

c

and

d

which occur in the quadrature formulae described in Section 3. c is not used if

itype = 0

; d is not used unless

itype = 1

−1

5

−5

. For some rules c and d must not be too large (see Section 6).

6: $n$ – Integer Input

On entry:

n

, the number of weights and abscissae to be returned. If

itype = −2

−4

and

c \neq 0.0

, an odd value of n may raise problems (see

ifail = 6

Constraint:

n > 0

7: $weight (n)$ – Real (Kind=nag_wp) array Output

On exit: the n weights.

8: $abscis (n)$ – Real (Kind=nag_wp) array Output

On exit: the n abscissae.

9: $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$: The algorithm for computing eigenvalues of a tridiagonal matrix has failed to converge.

$ifail = 2$: On entry, $itype = ⟨ value ⟩$ .
Constraint: $| itype | < 6$ .

On entry, $n = ⟨ value ⟩$ .
Constraint: $n > 0$ .

$ifail = 3$: On entry, a, b, c, or d is not in the allowed range: $a = ⟨ value ⟩$ , $b = ⟨ value ⟩$ $c = ⟨ value ⟩$ , $d = ⟨ value ⟩$ and $itype = ⟨ value ⟩$ .

$ifail = 4$: One or more of the weights are larger than $rmax$ , the largest floating point number on this computer (see x02alf): $rmax = ⟨ value ⟩$ .
Possible solutions are to use a smaller value of $n$ ; or, if using adjusted weights to change to normal weights.

$ifail = 5$: One or more of the weights are too small to be distinguished from zero on this machine.
The underflowing weights are returned as zero, which may be a usable approximation.
Possible solutions are to use a smaller value of $n$ ; or, if using normal weights, to change to adjusted weights.

$ifail = 6$

Exponential Gauss or Gauss–Hermite adjusted weights with n odd and

c \neq 0.0

Theoretically, in these cases:

for $c > 0.0$ , the central adjusted weight is infinite, and the exact function $f (x)$ is zero at the central abscissa;
for $c < 0.0$ , the central adjusted weight is zero, and the exact function $f (x)$ is infinite at the central abscissa.

In either case, the contribution of the central abscissa to the summation is indeterminate.

In practice, the central weight may not have overflowed or underflowed, if there is sufficient rounding error in the value of the central abscissa.

The weights and abscissa returned may be usable; you must be particularly careful not to ‘round’ the central abscissa to its true value without simultaneously ‘rounding’ the central weight to zero or

\infty

as appropriate, or the summation will suffer. It would be preferable to use normal weights, if possible.

Note: remember that, when switching from normal weights to adjusted weights or vice versa, redefinition of

f (x)

is involved.

$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

The accuracy depends mainly on

n

, with increasing loss of accuracy for larger values of

n

. Typically, one or two decimal digits may be lost from machine accuracy with

n ≃ 20

, and three or four decimal digits may be lost for

n ≃ 100

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.

d01tcf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The major portion of the time is taken up during the calculation of the eigenvalues of the appropriate tridiagonal matrix, where the time is roughly proportional to