# NAG FL Interfaced01alf (dim1_​fin_​sing)

Note: this routine is deprecated. Replaced by d01rlf.

## ▸▿ Contents

Settings help

FL Name Style:

FL Specification Language:

## 1Purpose

d01alf is a general purpose integrator which calculates an approximation to the integral of a function $f\left(x\right)$ over a finite interval $\left[a,b\right]$:
 $I= ∫ab f(x) dx$
where the integrand may have local singular behaviour at a finite number of points within the integration interval.

## 2Specification

Fortran Interface
 Subroutine d01alf ( f, a, b, npts, w, lw, iw, liw,
 Integer, Intent (In) :: npts, lw, liw Integer, Intent (Inout) :: ifail Integer, Intent (Out) :: iw(liw) Real (Kind=nag_wp), External :: f Real (Kind=nag_wp), Intent (In) :: a, b, points(*), epsabs, epsrel Real (Kind=nag_wp), Intent (Out) :: result, abserr, w(lw)
#include <nag.h>
 void d01alf_ (double (NAG_CALL *f)(const double *x),const double *a, const double *b, const Integer *npts, const double points[], const double *epsabs, const double *epsrel, double *result, double *abserr, double w[], const Integer *lw, Integer iw[], const Integer *liw, Integer *ifail)
The routine may be called by the names d01alf or nagf_quad_dim1_fin_sing.

## 3Description

d01alf is based on the QUADPACK routine QAGP (see Piessens et al. (1983)). It is very similar to d01ajf, but allows you to supply ‘break-points’, points at which the integrand is known to be difficult. It employs an adaptive algorithm, 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 $\epsilon$-algorithm (see Wynn (1956)) to perform extrapolation. The user-supplied ‘break-points’ always occur as the end points of some sub-interval during the adaptive process. The local error estimation is described in Piessens et al. (1983).
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 ${e}_{m}\left({S}_{n}\right)$ transformation Math. Tables Aids Comput. 10 91–96

## 5Arguments

1: $\mathbf{f}$real (Kind=nag_wp) Function, supplied by the user. External Procedure
f must return the value of the integrand $f$ at a given point.
The specification of f is:
Fortran Interface
 Function f ( x)
 Real (Kind=nag_wp) :: f Real (Kind=nag_wp), Intent (In) :: x
 double f (const double *x)
1: $\mathbf{x}$Real (Kind=nag_wp) Input
On entry: the point at which the integrand $f$ must be evaluated.
f must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which d01alf is called. Arguments denoted as Input must not be changed by this procedure.
Note: f should not return floating-point NaN (Not a Number) or infinity values, since these are not handled by d01alf. If your code inadvertently does return any NaNs or infinities, d01alf is likely to produce unexpected results.
2: $\mathbf{a}$Real (Kind=nag_wp) Input
On entry: $a$, the lower limit of integration.
3: $\mathbf{b}$Real (Kind=nag_wp) Input
On entry: $b$, the upper limit of integration. It is not necessary that $a.
4: $\mathbf{npts}$Integer Input
On entry: the number of user-supplied break-points within the integration interval.
Constraint: ${\mathbf{npts}}\ge 0$ and ${\mathbf{npts}}<\mathrm{min}\left(\left({\mathbf{lw}}-2×{\mathbf{npts}}-4\right)/4,\left({\mathbf{liw}}-{\mathbf{npts}}-2\right)/2\right)$.
5: $\mathbf{points}\left(*\right)$Real (Kind=nag_wp) array Input
Note: the dimension of the array points must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{npts}}\right)$.
On entry: the user-specified break-points.
Constraint: the break-points must all lie within the interval of integration (but may be supplied in any order).
6: $\mathbf{epsabs}$Real (Kind=nag_wp) Input
On entry: the absolute accuracy required. If epsabs is negative, the absolute value is used. See Section 7.
7: $\mathbf{epsrel}$Real (Kind=nag_wp) Input
On entry: the relative accuracy required. If epsrel is negative, the absolute value is used. See Section 7.
8: $\mathbf{result}$Real (Kind=nag_wp) Output
On exit: the approximation to the integral $I$.
9: $\mathbf{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-{\mathbf{result}}|$.
10: $\mathbf{w}\left({\mathbf{lw}}\right)$Real (Kind=nag_wp) array Output
On exit: details of the computation see Section 9 for more information.
11: $\mathbf{lw}$Integer Input
On entry: the dimension of the array w as declared in the (sub)program from which d01alf 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 $\left({\mathbf{lw}}-2×{\mathbf{npts}}-4\right)/4$. The more difficult the integrand, the larger lw should be.
Suggested value: a value in the range $800$ to $2000$ is adequate for most problems.
Constraint: ${\mathbf{lw}}\ge 2×{\mathbf{npts}}+8$.
12: $\mathbf{iw}\left({\mathbf{liw}}\right)$Integer array Output
On exit: ${\mathbf{iw}}\left(1\right)$ contains the actual number of sub-intervals used. The rest of the array is used as workspace.
13: $\mathbf{liw}$Integer Input
On entry: the dimension of the array iw as declared in the (sub)program from which d01alf is called. The number of sub-intervals into which the interval of integration may be divided cannot exceed $\left({\mathbf{liw}}-{\mathbf{npts}}-2\right)/2$.
Suggested value: ${\mathbf{liw}}={\mathbf{lw}}/2$.
Constraint: ${\mathbf{liw}}\ge {\mathbf{npts}}+4$.
14: $\mathbf{ifail}$Integer Input/Output
On entry: ifail must be set to $0$, $-1$ or $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$ or $1$ is recommended. If message printing is undesirable, then the value $1$ is recommended. Otherwise, the value $-1$ is recommended since useful values can be provided in some output arguments even when ${\mathbf{ifail}}\ne {\mathbf{0}}$ on exit. When the value $-\mathbf{1}$ or $\mathbf{1}$ is used it is essential to test the value of ifail on exit.
On exit: ${\mathbf{ifail}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6Error Indicators and Warnings

If on entry ${\mathbf{ifail}}=0$ or $-1$, explanatory error messages are output on the current error message unit (as defined by x04aaf).
Errors or warnings detected by the routine:
Note: in some cases d01alf may return useful information.
${\mathbf{ifail}}=1$
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.) it should be supplied to the routine as an element of the vector points. 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.
${\mathbf{ifail}}=2$
Round-off error prevents the requested tolerance from being achieved: ${\mathbf{epsabs}}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{epsrel}}=⟨\mathit{\text{value}}⟩$.
${\mathbf{ifail}}=3$
Extremely bad integrand behaviour occurs around the sub-interval $\left(⟨\mathit{\text{value}}⟩,⟨\mathit{\text{value}}⟩\right)$. The same advice applies as in the case of ${\mathbf{ifail}}={\mathbf{1}}$.
${\mathbf{ifail}}=4$
Round-off error is detected in the extrapolation table. The requested tolerance cannot be achieved because the extrapolation does not increase the accuracy satisfactorily; the returned result is the best that can be obtained. The same advice applies as in the case of ${\mathbf{ifail}}={\mathbf{1}}$.
${\mathbf{ifail}}=5$
The integral is probably divergent or slowly convergent.
${\mathbf{ifail}}=6$
On entry, break-points are specified outside $\left({\mathbf{a}},{\mathbf{b}}\right)$: ${\mathbf{a}}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{b}}=⟨\mathit{\text{value}}⟩$.
On entry, $\mathrm{LIMIT}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{npts}}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathrm{LIMIT}>{\mathbf{npts}}$.
On entry, ${\mathbf{npts}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{npts}}\ge 0$.
${\mathbf{ifail}}=7$
On entry, liw is too small. ${\mathbf{liw}}=⟨\mathit{\text{value}}⟩$. Minimum possible dimension: $⟨\mathit{\text{value}}⟩$.
On entry, lw is too small. ${\mathbf{lw}}=⟨\mathit{\text{value}}⟩$. Minimum possible dimension: $⟨\mathit{\text{value}}⟩$.
${\mathbf{ifail}}=-99$
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{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.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

## 7Accuracy

d01alf cannot guarantee, but in practice usually achieves, the following accuracy:
 $|I-result|≤tol,$
where
 $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
 $|I-result|≤abserr≤tol.$

## 8Parallelism and Performance

d01alf is not threaded in any implementation.

The time taken by d01alf depends on the integrand and the accuracy required.
If ${\mathbf{ifail}}\ne {\mathbf{0}}$ 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 d01alf along with the integral contributions and error estimates over these sub-intervals.
Specifically, for $i=1,2,\dots ,n$, let ${r}_{i}$ denote the approximation to the value of the integral over the sub-interval $\left[{a}_{i},{b}_{i}\right]$ in the partition of $\left[a,b\right]$ and ${e}_{i}$ be the corresponding absolute error estimate. Then, $\underset{{a}_{i}}{\overset{{b}_{i}}{\int }}f\left(x\right)dx\simeq {r}_{i}$ and ${\mathbf{result}}=\sum _{i=1}^{n}{r}_{i}$ unless d01alf 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 ${\mathbf{iw}}\left(1\right)$, and the values ${a}_{i}$, ${b}_{i}$, ${e}_{i}$ and ${r}_{i}$ are stored consecutively in the array w, that is:
• ${a}_{i}={\mathbf{w}}\left(i\right)$,
• ${b}_{i}={\mathbf{w}}\left(n+i\right)$,
• ${e}_{i}={\mathbf{w}}\left(2n+i\right)$ and
• ${r}_{i}={\mathbf{w}}\left(3n+i\right)$.

## 10Example

This example computes
 $∫ 0 1 1 |x-1/7| dx .$
A break-point is specified at $x=1/7$, at which point the integrand is infinite. (For definiteness the function f returns the value $0.0$ at this point.)

### 10.1Program Text

Program Text (d01alfe.f90)

None.

### 10.3Program Results

Program Results (d01alfe.r)