D01ATF (PDF version)
D01 Chapter Contents
D01 Chapter Introduction
NAG Library Manual

NAG Library Routine Document


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

D01ATF is a general purpose integrator which calculates an approximation to the integral of a function fx over a finite interval a,b:
I= ab fx dx .

2  Specification


3  Description

D01ATF is based on the QUADPACK routine QAGS (see Piessens et al. (1983)). It is an adaptive routine, using the Gauss 10-point and Kronrod 21-point rules. The algorithm, described in de Doncker (1978), incorporates a global acceptance criterion (as defined by Malcolm and Simpson (1976)) together with the ε-algorithm (see Wynn (1956)) to perform extrapolation. The local error estimation is described in Piessens et al. (1983).
The routine is suitable as a general purpose integrator, and can be used when the integrand has singularities, especially when these are of algebraic or logarithmic type.
D01ATF requires a subroutine to evaluate the integrand at an array of different points and is therefore particularly efficient when the evaluation can be performed in vector mode on a vector-processing machine. Otherwise the algorithm is identical to that used by D01AJF.

4  References

de Doncker E (1978) An adaptive extrapolation algorithm for automatic integration ACM SIGNUM Newsl. 13(2) 12–18
Malcolm M A and Simpson R B (1976) Local versus global strategies for adaptive quadrature ACM Trans. Math. Software 1 129–146
Piessens R, de Doncker–Kapenga E, Überhuber C and Kahaner D (1983) QUADPACK, A Subroutine Package for Automatic Integration Springer–Verlag
Wynn P (1956) On a device for computing the emSn transformation Math. Tables Aids Comput. 10 91–96

5  Parameters

1:     F – SUBROUTINE, supplied by the user.External Procedure
F must return the values of the integrand f at a set of points.
The specification of F is:
REAL (KIND=nag_wp)  X(N), FV(N)
1:     X(N) – REAL (KIND=nag_wp) arrayInput
On entry: the points at which the integrand f must be evaluated.
2:     FV(N) – REAL (KIND=nag_wp) arrayOutput
On exit: FVj must contain the value of f at the point Xj, for j=1,2,,N.
3:     N – INTEGERInput
On entry: the number of points at which the integrand is to be evaluated. The actual value of N is always 21.
F must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which D01ATF is called. Parameters denoted as Input must not be changed by this procedure.
2:     A – REAL (KIND=nag_wp)Input
On entry: a, the lower limit of integration.
3:     B – REAL (KIND=nag_wp)Input
On entry: b, the upper limit of integration. It is not necessary that a<b.
4:     EPSABS – REAL (KIND=nag_wp)Input
On entry: the absolute accuracy required. If EPSABS is negative, the absolute value is used. See Section 7.
5:     EPSREL – REAL (KIND=nag_wp)Input
On entry: the relative accuracy required. If EPSREL is negative, the absolute value is used. See Section 7.
6:     RESULT – REAL (KIND=nag_wp)Output
On exit: the approximation to the integral I.
7:     ABSERR – REAL (KIND=nag_wp)Output
On exit: an estimate of the modulus of the absolute error, which should be an upper bound for I-RESULT.
8:     W(LW) – REAL (KIND=nag_wp) arrayOutput
On exit: details of the computation see Section 8 for more information.
9:     LW – INTEGERInput
On entry: the dimension of the array W as declared in the (sub)program from which D01ATF is called. The value of LW (together with that of LIW) imposes a bound on the number of sub-intervals into which the interval of integration may be divided by the routine. The number of sub-intervals cannot exceed LW/4. The more difficult the integrand, the larger LW should be.
Suggested value: LW=800 to 2000 is adequate for most problems.
Constraint: LW4.
10:   IW(LIW) – INTEGER arrayOutput
On exit: IW1 contains the actual number of sub-intervals used. The rest of the array is used as workspace.
11:   LIW – INTEGERInput
On entry: the dimension of the array IW as declared in the (sub)program from which D01ATF is called. The number of sub-intervals into which the interval of integration may be divided cannot exceed LIW.
Suggested value: LIW=LW/4.
Constraint: LIW1.
12:   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: D01ATF may return useful information for one or more of the following detected errors or warnings.
Errors or warnings detected by the routine:
The maximum number of subdivisions allowed with the given workspace has been reached without the accuracy requirements being achieved. Look at the integrand in order to determine the integration difficulties. If the position of a local difficulty within the interval can be determined (e.g., a singularity of the integrand or its derivative, a peak, a discontinuity, etc.) you will probably gain from splitting up the interval at this point and calling the integrator on the subranges. If necessary, another integrator, which is designed for handling the type of difficulty involved, must be used. Alternatively, consider relaxing the accuracy requirements specified by EPSABS and EPSREL, or increasing the amount of workspace.
Round-off error prevents the requested tolerance from being achieved. Consider requesting less accuracy.
Extremely bad local integrand behaviour causes a very strong subdivision around one (or more) points of the interval. The same advice applies as in the case of IFAIL=1.
The requested tolerance cannot be achieved because the extrapolation does not increase the accuracy satisfactorily; the returned result is the best which can be obtained. The same advice applies as in the case of IFAIL=1.
The integral is probably divergent, or slowly convergent. Please note that divergence can occur with any nonzero value of IFAIL.
On entry,LW<4,

7  Accuracy

D01ATF cannot guarantee, but in practice usually achieves, the following accuracy:
I-RESULT tol ,
tol = max EPSABS , EPSREL × I ,
and EPSABS and EPSREL are user-specified absolute and relative error tolerances. Moreover, it returns the quantity ABSERR which, in normal circumstances, satisfies

8  Further Comments

If IFAIL0 on exit, then you may wish to examine the contents of the array W, which contains the end points of the sub-intervals used by D01ATF along with the integral contributions and error estimates over the sub-intervals.
Specifically, for i=1,2,,n, let ri denote the approximation to the value of the integral over the sub-interval ai,bi  in the partition of a,b  and ei  be the corresponding absolute error estimate. Then, ai bi fx dx ri  and RESULT = i=1 n ri , unless D01ATF terminates while testing for divergence of the integral (see Section 3.4.3 of Piessens et al. (1983)). In this case, RESULT (and ABSERR) are taken to be the values returned from the extrapolation process. The value of n is returned in IW1, and the values ai, bi, ei and ri are stored consecutively in the array W, that is:

9  Example

This example computes
0 2π x sin30x 1 - x/2π 2 dx .

9.1  Program Text

Program Text (d01atfe.f90)

9.2  Program Data


9.3  Program Results

Program Results (d01atfe.r)

D01ATF (PDF version)
D01 Chapter Contents
D01 Chapter Introduction
NAG Library Manual

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