d01rkc is an adaptive integrator, especially suited to oscillating, nonsingular integrands, which calculates an approximation to the integral of a function over a finite interval :
The function may be called by the names: d01rkc or nag_quad_dim1_fin_osc_fn.
3Description
d01rkc is based on the QUADPACK routine QAG (see Piessens et al. (1983)). It is an adaptive function, offering a choice of six Gauss–Kronrod rules. A ‘global’ acceptance criterion (as defined by Malcolm and Simpson (1976)) is used. The local error estimation is described in Piessens et al. (1983).
Because d01rkc is based on integration rules of high order, it is especially suitable for nonsingular oscillating integrands.
d01rkc requires you to supply a function to evaluate the integrand at an array of points.
4References
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. Software1 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 transformation Math. Tables Aids Comput.10 91–96
5Arguments
1: – function, supplied by the userExternal Function
f must return the values of the integrand at a set of points.
f (const double x[],Integer nx,double fv[],Integer *iflag,Nag_Comm *comm)
1: – const doubleInput
On entry: the abscissae,
, for , at which function values are required.
2: – IntegerInput
On entry: the number of abscissae at which a function value is required. nx will be of size equal to the number of Kronrod points in the quadrature rule used, as determined by the choice of value for key.
3: – doubleOutput
On exit: fv must contain the values of the integrand . for all .
4: – Integer *Input/Output
On entry: .
On exit: set to force an immediate exit with NE_USER_STOP.
5: – Nag_Comm *
Pointer to structure of type Nag_Comm; the following members are relevant to f.
user – double *
iuser – Integer *
p – Pointer
The type Pointer will be void *. Before calling d01rkc you may allocate memory and initialize these pointers with various quantities for use by f when called from d01rkc (see Section 3.1.1 in the Introduction to the NAG Library CL Interface).
Note:f should not return floating-point NaN (Not a Number) or infinity values, since these are not handled by d01rkc. If your code inadvertently does return any NaNs or infinities, d01rkc is likely to produce unexpected results.
2: – doubleInput
On entry: , the lower limit of integration.
3: – doubleInput
On entry: , the upper limit of integration. It is not necessary that .
Note: if , the function will immediately return with , , and .
4: – IntegerInput
On entry: indicates which integration rule is to be used. The number of function evaluations required for an integral estimate over any segment will be the number of Kronrod points, .
For the Gauss -point and Kronrod -point rule.
For the Gauss -point and Kronrod -point rule.
For the Gauss -point and Kronrod -point rule.
For the Gauss -point and Kronrod -point rule.
For the Gauss -point and Kronrod -point rule.
For the Gauss -point and Kronrod -point rule.
Suggested value:
.
Constraint:
, , , , or .
5: – doubleInput
On entry: , the absolute accuracy required. If epsabs is negative, . See Section 7.
6: – doubleInput
On entry: , the relative accuracy required. If epsrel is negative, . See Section 7.
7: – IntegerInput
On entry: , the upper bound on the total number of subdivisions d01rkc may use to generate new segments. If , only the initial segment will be evaluated.
Suggested value:
a value in the range to is adequate for most problems.
Constraint:
.
8: – double *Output
On exit: the approximation to the integral .
9: – double *Output
On exit: an estimate of the modulus of the absolute error, which should be an upper bound for .
10: – doubleOutput
On exit: details of the computation. See Section 9 for more information.
11: – IntegerOutput
On exit: details of the computation. See Section 9 for more information.
12: – Nag_Comm *
The NAG communication argument (see Section 3.1.1 in the Introduction to the NAG Library CL Interface).
13: – NagError *Input/Output
The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).
6Error 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_BAD_PARAM
On entry, argument had an illegal value.
On entry, . Constraint: , , , , or .
NE_INT
On entry, . Constraint: .
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_QUAD_BAD_SUBDIV
Extremely bad integrand behaviour occurs around the sub-interval . The same advice applies as in the case of NE_QUAD_MAX_SUBDIV.
NE_QUAD_MAX_SUBDIV
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 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.
NE_QUAD_ROUNDOFF_TOL
Round-off error prevents the requested tolerance from being achieved: and .
d01rkc cannot guarantee, but in practice usually achieves, the following accuracy:
where
and epsabs and epsrel are user-specified absolute and relative error tolerances. Moreover, it returns the quantity abserr which, in normal circumstances, satisfies
8Parallelism and Performance
d01rkc is not threaded in any implementation.
9Further Comments
The time taken by d01rkc depends on the integrand and the accuracy required.
If NE_NOERROR, NE_QUAD_BAD_SUBDIV, NE_QUAD_MAX_SUBDIV or NE_QUAD_ROUNDOFF_TOL, or if NE_USER_STOP and at least one complete vector evaluation of f was completed, result and abserr will contain computed results.
If these results are unacceptable, or if otherwise required, then you may wish to examine the contents of the array rinfo, which contains the end points of the sub-intervals used by d01rkc along with the integral contributions and error estimates over the sub-intervals.
Specifically, for , let denote the approximation to the value of the integral over the sub-interval in the partition of and be the corresponding absolute error estimate. Then, and . The value of is returned in , and the values , , and are stored consecutively in the array rinfo, that is:
,
,
and
.
The total number of abscissae at which the function was evaluated is returned in .